Base | Representation |
---|---|
bin | 1001000110000101000110… |
… | …11101010100001011011010 |
3 | 2121210222210001122020010100 |
4 | 10203002203131110023122 |
5 | 10110140211141214320 |
6 | 110311531310000230 |
7 | 4132650241614441 |
oct | 443024335241332 |
9 | 77728701566110 |
10 | 20000110101210 |
11 | 6410aa9828778 |
12 | 22b01a44a6076 |
13 | b21005053195 |
14 | 4d2020b1bd58 |
15 | 24a3ae883790 |
hex | 1230a37542da |
20000110101210 has 48 divisors (see below), whose sum is σ = 52001115529896. Its totient is φ = 5333277640704.
The previous prime is 20000110101161. The next prime is 20000110101211. The reversal of 20000110101210 is 1210101100002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 15160035300921 + 4840074800289 = 3893589^2 + 2200017^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20000110101192 and 20000110101201.
It is not an unprimeable number, because it can be changed into a prime (20000110101211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4007122 + ... + 7487138.
Almost surely, 220000110101210 is an apocalyptic number.
20000110101210 is an abundant number, since it is smaller than the sum of its proper divisors (32001005428686).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000110101210 is a wasteful number, since it uses less digits than its factorization.
20000110101210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3543887 (or 3543884 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20000110101210 its reverse (1210101100002), we get a palindrome (21210211201212).
The spelling of 20000110101210 in words is "twenty trillion, one hundred ten million, one hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •