Base | Representation |
---|---|
bin | 10110101111011111000100… |
… | …100011101110010101001101 |
3 | 111010010211121210021210211010 |
4 | 112233133010203232111031 |
5 | 101102212332441333401 |
6 | 552420351314515433 |
7 | 30032135552633112 |
oct | 2657370443562515 |
9 | 433124553253733 |
10 | 100020201121101 |
11 | 29962369014488 |
12 | b274702b95b79 |
13 | 43a6b313ab241 |
14 | 1a9b009acc909 |
15 | b86b4d016ed6 |
hex | 5af7c48ee54d |
100020201121101 has 32 divisors (see below), whose sum is σ = 136705288982400. Its totient is φ = 65027681452800.
The previous prime is 100020201121081. The next prime is 100020201121121. The reversal of 100020201121101 is 101121102020001.
It is an interprime number because it is at equal distance from previous prime (100020201121081) and next prime (100020201121121).
It is not a de Polignac number, because 100020201121101 - 211 = 100020201119053 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100020201121121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 195222495 + ... + 195734163.
It is an arithmetic number, because the mean of its divisors is an integer number (4272040280700).
Almost surely, 2100020201121101 is an apocalyptic number.
It is an amenable number.
100020201121101 is a deficient number, since it is larger than the sum of its proper divisors (36685087861299).
100020201121101 is a wasteful number, since it uses less digits than its factorization.
100020201121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521469.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100020201121101 its reverse (101121102020001), we get a palindrome (201141303141102).
The spelling of 100020201121101 in words is "one hundred trillion, twenty billion, two hundred one million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •