Base | Representation |
---|---|
bin | 1001000110000101000111… |
… | …00101000001000011000001 |
3 | 2121210222210012102210101101 |
4 | 10203002203211001003001 |
5 | 10110140212200320001 |
6 | 110311531421134401 |
7 | 4132650265023226 |
oct | 443024345010301 |
9 | 77728705383341 |
10 | 20000112120001 |
11 | 6410aaa9874a2 |
12 | 22b01a50ba401 |
13 | b210055ac030 |
14 | 4d20210c594d |
15 | 24a3aeb31a01 |
hex | 1230a39410c1 |
20000112120001 has 16 divisors (see below), whose sum is σ = 21592345223680. Its totient is φ = 18415577759040.
The previous prime is 20000112119963. The next prime is 20000112120013. The reversal of 20000112120001 is 10002121100002.
It is a cyclic number.
It is not a de Polignac number, because 20000112120001 - 27 = 20000112119873 is a prime.
It is a super-2 number, since 2×200001121200012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20000112120001.
It is not an unprimeable number, because it can be changed into a prime (20000112120601) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25992856 + ... + 26751238.
It is an arithmetic number, because the mean of its divisors is an integer number (1349521576480).
Almost surely, 220000112120001 is an apocalyptic number.
It is an amenable number.
20000112120001 is a deficient number, since it is larger than the sum of its proper divisors (1592233103679).
20000112120001 is a wasteful number, since it uses less digits than its factorization.
20000112120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 763456.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20000112120001 its reverse (10002121100002), we get a palindrome (30002233220003).
The spelling of 20000112120001 in words is "twenty trillion, one hundred twelve million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •