Base | Representation |
---|---|
bin | 11101011100111111111… |
… | …01100010000100000011 |
3 | 10120202011002110112001011 |
4 | 32232133331202010003 |
5 | 113040034230202321 |
6 | 2052523514021351 |
7 | 133054220520664 |
oct | 16563775420403 |
9 | 3522132415034 |
10 | 1012001022211 |
11 | 360207215573 |
12 | 144171117857 |
13 | 7457b6ca70a |
14 | 36da424d36b |
15 | 1b4d0139ae1 |
hex | eb9ff62103 |
1012001022211 has 8 divisors (see below), whose sum is σ = 1014985050048. Its totient is φ = 1009021104000.
The previous prime is 1012001022203. The next prime is 1012001022269. The reversal of 1012001022211 is 1122201002101.
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 1012001022211 - 23 = 1012001022203 is a prime.
It is a super-2 number, since 2×10120010222112 (a number of 25 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 = 1012001022191 and 1012001022200.
It is not an unprimeable number, because it can be changed into a prime (1012001022271) 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, 533830 + ... + 1519531.
It is an arithmetic number, because the mean of its divisors is an integer number (126873131256).
Almost surely, 21012001022211 is an apocalyptic number.
1012001022211 is a deficient number, since it is larger than the sum of its proper divisors (2984027837).
1012001022211 is an equidigital number, since it uses as much as digits as its factorization.
1012001022211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2054813.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1012001022211 its reverse (1122201002101), we get a palindrome (2134202024312).
The spelling of 1012001022211 in words is "one trillion, twelve billion, one million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •