Base | Representation |
---|---|
bin | 11101000110101111110… |
… | …110100100101001001110 |
3 | 21002012122010001002021202 |
4 | 131012233312210221032 |
5 | 230232211142030220 |
6 | 4130500553025502 |
7 | 264334410302213 |
oct | 35065766445116 |
9 | 7065563032252 |
10 | 2000110111310 |
11 | 701273019073 |
12 | 2837749b5292 |
13 | 1167c03082ac |
14 | 6cb3d353b0a |
15 | 370629cd275 |
hex | 1d1afda4a4e |
2000110111310 has 64 divisors (see below), whose sum is σ = 3756115943424. Its totient is φ = 765963043200.
The previous prime is 2000110111291. The next prime is 2000110111331. The reversal of 2000110111310 is 131110110002.
It is a happy number.
It is a super-2 number, since 2×20001101113102 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2000110111291 and 2000110111300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32889452 + ... + 32950208.
It is an arithmetic number, because the mean of its divisors is an integer number (58689311616).
Almost surely, 22000110111310 is an apocalyptic number.
2000110111310 is a deficient number, since it is larger than the sum of its proper divisors (1756005832114).
2000110111310 is a wasteful number, since it uses less digits than its factorization.
2000110111310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61929.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 2000110111310 its reverse (131110110002), we get a palindrome (2131220221312).
The spelling of 2000110111310 in words is "two trillion, one hundred ten million, one hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •