Base | Representation |
---|---|
bin | 10110110000111101001001… |
… | …001110010010100111100100 |
3 | 111010111111100100102102020011 |
4 | 112300331021032102213210 |
5 | 101110341220021320400 |
6 | 552535014401420004 |
7 | 30042342642516112 |
oct | 2660751116224744 |
9 | 433444310372204 |
10 | 100121211120100 |
11 | 299a11925827a5 |
12 | b2901b303a604 |
13 | 43b350b219111 |
14 | 1aa1c6cd40ab2 |
15 | b895b0c5a8ba |
hex | 5b0f493929e4 |
100121211120100 has 72 divisors (see below), whose sum is σ = 221642373230208. Its totient is φ = 39247987161600.
The previous prime is 100121211120079. The next prime is 100121211120149. The reversal of 100121211120100 is 1021112121001.
It is a happy 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 23 ways as a sum of consecutive naturals, for example, 41034597 + ... + 43405996.
It is an arithmetic number, because the mean of its divisors is an integer number (3078366294864).
Almost surely, 2100121211120100 is an apocalyptic number.
100121211120100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100121211120100 is an abundant number, since it is smaller than the sum of its proper divisors (121521162110108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100121211120100 is a wasteful number, since it uses less digits than its factorization.
100121211120100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84440845 (or 84440838 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100121211120100 its reverse (1021112121001), we get a palindrome (101142323241101).
The spelling of 100121211120100 in words is "one hundred trillion, one hundred twenty-one billion, two hundred eleven million, one hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •