Base | Representation |
---|---|
bin | 1001010010010111110000… |
… | …1001000011010000110001 |
3 | 1100011011221110221111120221 |
4 | 2110211330021003100301 |
5 | 2314300034310310113 |
6 | 33414545242533041 |
7 | 2102510356661650 |
oct | 224457411032061 |
9 | 40134843844527 |
10 | 10211220010033 |
11 | 3287610542889 |
12 | 118b004b07181 |
13 | 590bb5b44193 |
14 | 2743233d1197 |
15 | 12a93d41498d |
hex | 9497c243431 |
10211220010033 has 16 divisors (see below), whose sum is σ = 12345904000000. Its totient is φ = 8250150305232.
The previous prime is 10211220010031. The next prime is 10211220010087. The reversal of 10211220010033 is 33001002211201.
It is a cyclic number.
It is not a de Polignac number, because 10211220010033 - 21 = 10211220010031 is a prime.
It is a super-2 number, since 2×102112200100332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10211220009989 and 10211220010016.
It is not an unprimeable number, because it can be changed into a prime (10211220010031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 192878283 + ... + 192931216.
It is an arithmetic number, because the mean of its divisors is an integer number (771619000000).
Almost surely, 210211220010033 is an apocalyptic number.
It is an amenable number.
10211220010033 is a deficient number, since it is larger than the sum of its proper divisors (2134683989967).
10211220010033 is a wasteful number, since it uses less digits than its factorization.
10211220010033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 385809724.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10211220010033 its reverse (33001002211201), we get a palindrome (43212222221234).
The spelling of 10211220010033 in words is "ten trillion, two hundred eleven billion, two hundred twenty million, ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •