Base | Representation |
---|---|
bin | 1001010011101010100011… |
… | …0000100100010101111011 |
3 | 1100020022022021011211210012 |
4 | 2110322220300210111323 |
5 | 2320131043002400011 |
6 | 33433102355212135 |
7 | 2104225160465324 |
oct | 224725060442573 |
9 | 40208267154705 |
10 | 10233443403131 |
11 | 3295a85019a63 |
12 | 11933875a704b |
13 | 593018051120 |
14 | 275430ac344b |
15 | 12b2de46da8b |
hex | 94ea8c2457b |
10233443403131 has 8 divisors (see below), whose sum is σ = 11026833200544. Its totient is φ = 9440939583360.
The previous prime is 10233443403097. The next prime is 10233443403137. The reversal of 10233443403131 is 13130434433201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10233443403131 - 230 = 10232369661307 is a prime.
It is a super-2 number, since 2×102334434031312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10233443403137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 221470415 + ... + 221516616.
It is an arithmetic number, because the mean of its divisors is an integer number (1378354150068).
Almost surely, 210233443403131 is an apocalyptic number.
10233443403131 is a deficient number, since it is larger than the sum of its proper divisors (793389797413).
10233443403131 is a wasteful number, since it uses less digits than its factorization.
10233443403131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442988821.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 10233443403131 its reverse (13130434433201), we get a palindrome (23363877836332).
The spelling of 10233443403131 in words is "ten trillion, two hundred thirty-three billion, four hundred forty-three million, four hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •