Base | Representation |
---|---|
bin | 1001010010010110111111… |
… | …0100100011101100000001 |
3 | 1100011011102002000010010211 |
4 | 2110211233310203230001 |
5 | 2314244123401424413 |
6 | 33414512540354121 |
7 | 2102502300034360 |
oct | 224455764435401 |
9 | 40134362003124 |
10 | 10211013311233 |
11 | 32875148a4a29 |
12 | 118ab67845941 |
13 | 590b82082ab7 |
14 | 274303b877d7 |
15 | 12a92a1d583d |
hex | 9496fd23b01 |
10211013311233 has 8 divisors (see below), whose sum is σ = 11673514709568. Its totient is φ = 8749458215664.
The previous prime is 10211013311221. The next prime is 10211013311251. The reversal of 10211013311233 is 33211331011201.
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 10211013311233 - 213 = 10211013303041 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10211013371233) 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, 236552566 + ... + 236595727.
It is an arithmetic number, because the mean of its divisors is an integer number (1459189338696).
Almost surely, 210211013311233 is an apocalyptic number.
It is an amenable number.
10211013311233 is a deficient number, since it is larger than the sum of its proper divisors (1462501398335).
10211013311233 is an equidigital number, since it uses as much as digits as its factorization.
10211013311233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473151383.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10211013311233 its reverse (33211331011201), we get a palindrome (43422344322434).
It can be divided in two parts, 1021101 and 3311233, that added together give a palindrome (4332334).
The spelling of 10211013311233 in words is "ten trillion, two hundred eleven billion, thirteen million, three hundred eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •