Base | Representation |
---|---|
bin | 10110110000101001100110… |
… | …000011100110100111010101 |
3 | 111010102111011102222002212221 |
4 | 112300221212003212213111 |
5 | 101110020222311134310 |
6 | 552521223425342341 |
7 | 30041000524233055 |
oct | 2660514603464725 |
9 | 433374142862787 |
10 | 100100220021205 |
11 | 299932a065a488 |
12 | b2881151979b1 |
13 | 43b15443cc941 |
14 | 1aa0c3b187565 |
15 | b88c82ebaada |
hex | 5b0a660e69d5 |
100100220021205 has 64 divisors (see below), whose sum is σ = 130174868275200. Its totient is φ = 73645070400000.
The previous prime is 100100220021157. The next prime is 100100220021253. The reversal of 100100220021205 is 502120022001001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (100100220021157) and next prime (100100220021253).
It is not a de Polignac number, because 100100220021205 - 215 = 100100219988437 is a prime.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 968794536 + ... + 968897854.
It is an arithmetic number, because the mean of its divisors is an integer number (2033982316800).
Almost surely, 2100100220021205 is an apocalyptic number.
It is an amenable number.
100100220021205 is a deficient number, since it is larger than the sum of its proper divisors (30074648253995).
100100220021205 is a wasteful number, since it uses less digits than its factorization.
100100220021205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104626.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 100100220021205 its reverse (502120022001001), we get a palindrome (602220242022206).
The spelling of 100100220021205 in words is "one hundred trillion, one hundred billion, two hundred twenty million, twenty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •