Base | Representation |
---|---|
bin | 10110111110001101101010… |
… | …011110101011100000100001 |
3 | 111020201121000211220020111121 |
4 | 112332031222132223200201 |
5 | 101220303123321144413 |
6 | 554513333204012241 |
7 | 30165225426366064 |
oct | 2676155236534041 |
9 | 436647024806447 |
10 | 101032302131233 |
11 | 2a2126167123a0 |
12 | b3b88a1691081 |
13 | 444b3c7716ab5 |
14 | 1ad3dbd3288db |
15 | ba3136d02b8d |
hex | 5be36a7ab821 |
101032302131233 has 32 divisors (see below), whose sum is σ = 112105734773760. Its totient is φ = 90275875368000.
The previous prime is 101032302131221. The next prime is 101032302131261. The reversal of 101032302131233 is 332131203230101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101032302131233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101032302131198 and 101032302131207.
It is not an unprimeable number, because it can be changed into a prime (101032302134233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6609026316 + ... + 6609041602.
It is an arithmetic number, because the mean of its divisors is an integer number (3503304211680).
Almost surely, 2101032302131233 is an apocalyptic number.
It is an amenable number.
101032302131233 is a deficient number, since it is larger than the sum of its proper divisors (11073432642527).
101032302131233 is a wasteful number, since it uses less digits than its factorization.
101032302131233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21909.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 101032302131233 its reverse (332131203230101), we get a palindrome (433163505361334).
The spelling of 101032302131233 in words is "one hundred one trillion, thirty-two billion, three hundred two million, one hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •