Base | Representation |
---|---|
bin | 1101100100011100001… |
… | …0011000110110101101 |
3 | 211021201112111011102221 |
4 | 3121013002120312231 |
5 | 12304412212324123 |
6 | 255032135315341 |
7 | 22561634444266 |
oct | 3310702306655 |
9 | 737645434387 |
10 | 233120042413 |
11 | 8a958206285 |
12 | 3921b51bb51 |
13 | 18ca1c08acb |
14 | b3d6a5d96d |
15 | 60e5e5525d |
hex | 3647098dad |
233120042413 has 16 divisors (see below), whose sum is σ = 241556878080. Its totient is φ = 224828128000.
The previous prime is 233120042399. The next prime is 233120042429. The reversal of 233120042413 is 314240021332.
233120042413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 233120042413 - 229 = 232583171501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233120043413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1255638 + ... + 1429288.
It is an arithmetic number, because the mean of its divisors is an integer number (15097304880).
Almost surely, 2233120042413 is an apocalyptic number.
It is an amenable number.
233120042413 is a deficient number, since it is larger than the sum of its proper divisors (8436835667).
233120042413 is a wasteful number, since it uses less digits than its factorization.
233120042413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174068.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 233120042413 its reverse (314240021332), we get a palindrome (547360063745).
The spelling of 233120042413 in words is "two hundred thirty-three billion, one hundred twenty million, forty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •