Base | Representation |
---|---|
bin | 10110110000111101001000… |
… | …100101000100000000001100 |
3 | 111010111111022121002022202110 |
4 | 112300331020211010000030 |
5 | 101110341204234443312 |
6 | 552535013334024020 |
7 | 30042342451613433 |
oct | 2660751045040014 |
9 | 433444277068673 |
10 | 100121200312332 |
11 | 299a1187470761 |
12 | b2901ab4a8010 |
13 | 43b3508c039a4 |
14 | 1aa1c6b72a11a |
15 | b895aed2343c |
hex | 5b0f4894400c |
100121200312332 has 24 divisors (see below), whose sum is σ = 233616568873072. Its totient is φ = 33373671321600.
The previous prime is 100121200312247. The next prime is 100121200312369. The reversal of 100121200312332 is 233213002121001.
It is a junction number, because it is equal to n+sod(n) for n = 100121200312299 and 100121200312308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 798469 + ... + 14173212.
Almost surely, 2100121200312332 is an apocalyptic number.
100121200312332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100121200312332 is an abundant number, since it is smaller than the sum of its proper divisors (133495368560740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100121200312332 is a wasteful number, since it uses less digits than its factorization.
100121200312332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15528969 (or 15528967 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 100121200312332 its reverse (233213002121001), we get a palindrome (333334202433333).
The spelling of 100121200312332 in words is "one hundred trillion, one hundred twenty-one billion, two hundred million, three hundred twelve thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •