Base | Representation |
---|---|
bin | 11101000110101111010… |
… | …111101011000010000011 |
3 | 21002012121112210112202200 |
4 | 131012233113223002003 |
5 | 230232202103323021 |
6 | 4130500103244243 |
7 | 264334251404166 |
oct | 35065727530203 |
9 | 7065545715680 |
10 | 2000102011011 |
11 | 701269496205 |
12 | 283772149683 |
13 | 1167bb730310 |
14 | 6cb3c245add |
15 | 37061e2d126 |
hex | 1d1af5eb083 |
2000102011011 has 48 divisors (see below), whose sum is σ = 3124920708000. Its totient is φ = 1225439847936.
The previous prime is 2000102011003. The next prime is 2000102011021. The reversal of 2000102011011 is 1101102010002.
It is a happy number.
It is not a de Polignac number, because 2000102011011 - 23 = 2000102011003 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 = 2000102010984 and 2000102011002.
It is not an unprimeable number, because it can be changed into a prime (2000102011021) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35932960 + ... + 35988578.
It is an arithmetic number, because the mean of its divisors is an integer number (65102514750).
Almost surely, 22000102011011 is an apocalyptic number.
2000102011011 is a deficient number, since it is larger than the sum of its proper divisors (1124818696989).
2000102011011 is a wasteful number, since it uses less digits than its factorization.
2000102011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56980 (or 56977 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2000102011011 its reverse (1101102010002), we get a palindrome (3101204021013).
The spelling of 2000102011011 in words is "two trillion, one hundred two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •