Base | Representation |
---|---|
bin | 11101101011111001011… |
… | …11100110001101011011 |
3 | 10121111210120010211120100 |
4 | 32311330233212031123 |
5 | 113202430011214321 |
6 | 2100325342030443 |
7 | 133456360544010 |
oct | 16657457461533 |
9 | 3544716124510 |
10 | 1020000101211 |
11 | 363641513a63 |
12 | 145823b78423 |
13 | 752549aa560 |
14 | 37522757707 |
15 | 1b7ec502326 |
hex | ed7cbe635b |
1020000101211 has 96 divisors (see below), whose sum is σ = 1901969491968. Its totient is φ = 512342288640.
The previous prime is 1020000101191. The next prime is 1020000101221. The reversal of 1020000101211 is 1121010000201.
It is a happy number.
It is not a de Polignac number, because 1020000101211 - 26 = 1020000101147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1020000101193 and 1020000101202.
It is not an unprimeable number, because it can be changed into a prime (1020000101221) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1066156 + ... + 1782326.
It is an arithmetic number, because the mean of its divisors is an integer number (19812182208).
Almost surely, 21020000101211 is an apocalyptic number.
1020000101211 is a deficient number, since it is larger than the sum of its proper divisors (881969390757).
1020000101211 is a wasteful number, since it uses less digits than its factorization.
1020000101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 716281 (or 716278 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1020000101211 its reverse (1121010000201), we get a palindrome (2141010101412).
It can be divided in two parts, 1020000 and 101211, that added together give a palindrome (1121211).
The spelling of 1020000101211 in words is "one trillion, twenty billion, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •