Base | Representation |
---|---|
bin | 1001001000111111010111… |
… | …11110100000100011010001 |
3 | 2122011112220021222201222222 |
4 | 10210133223332200203101 |
5 | 10113310011404310001 |
6 | 110425510304310425 |
7 | 4143120326406461 |
oct | 444375376404321 |
9 | 78145807881888 |
10 | 20100111010001 |
11 | 644a455724640 |
12 | 2307652612415 |
13 | b2a580ac0469 |
14 | 4d6bc9d37ba1 |
15 | 24ccb3bec61b |
hex | 1247ebfa08d1 |
20100111010001 has 16 divisors (see below), whose sum is σ = 22400406482688. Its totient is φ = 17878875715200.
The previous prime is 20100111009973. The next prime is 20100111010039. The reversal of 20100111010001 is 10001011100102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20100111010001 - 234 = 20082931140817 is a prime.
It is a super-2 number, since 2×201001110100012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20100111010051) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3827300 + ... + 7405973.
It is an arithmetic number, because the mean of its divisors is an integer number (1400025405168).
Almost surely, 220100111010001 is an apocalyptic number.
It is an amenable number.
20100111010001 is a deficient number, since it is larger than the sum of its proper divisors (2300295472687).
20100111010001 is a wasteful number, since it uses less digits than its factorization.
20100111010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11236792.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 20100111010001 its reverse (10001011100102), we get a palindrome (30101122110103).
The spelling of 20100111010001 in words is "twenty trillion, one hundred billion, one hundred eleven million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •