Base | Representation |
---|---|
bin | 1001001001010010000001… |
… | …00100001010000010100001 |
3 | 2122012111201211212012021000 |
4 | 10210221000210022002201 |
5 | 10113441011221200001 |
6 | 110434243414022213 |
7 | 4143623344311051 |
oct | 444510044120241 |
9 | 78174654765230 |
10 | 20110120100001 |
11 | 6453721588048 |
12 | 2309586647969 |
13 | b2b4b7641219 |
14 | 4d7499385561 |
15 | 24d19c7a3a86 |
hex | 124a4090a0a1 |
20110120100001 has 32 divisors (see below), whose sum is σ = 29950339645440. Its totient is φ = 13335848067600.
The previous prime is 20110120099991. The next prime is 20110120100029. The reversal of 20110120100001 is 10000102101102.
It is a happy number.
It is not a de Polignac number, because 20110120100001 - 214 = 20110120083617 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (20110120100701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 108322866 + ... + 108508356.
It is an arithmetic number, because the mean of its divisors is an integer number (935948113920).
Almost surely, 220110120100001 is an apocalyptic number.
It is an amenable number.
20110120100001 is a deficient number, since it is larger than the sum of its proper divisors (9840219545439).
20110120100001 is a wasteful number, since it uses less digits than its factorization.
20110120100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206714 (or 206708 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 20110120100001 its reverse (10000102101102), we get a palindrome (30110222201103).
The spelling of 20110120100001 in words is "twenty trillion, one hundred ten billion, one hundred twenty million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •