Base | Representation |
---|---|
bin | 10110110000111101010000… |
… | …011000000110101110000000 |
3 | 111010111111122201020201101221 |
4 | 112300331100120012232000 |
5 | 101110341441232231222 |
6 | 552535034330004424 |
7 | 30042345630563626 |
oct | 2660752030065600 |
9 | 433444581221357 |
10 | 100121331133312 |
11 | 299a12442a3475 |
12 | b290227276714 |
13 | 43b352a049058 |
14 | 1aa1c80c61516 |
15 | b895bb5650c7 |
hex | 5b0f50606b80 |
100121331133312 has 64 divisors (see below), whose sum is σ = 199970406604800. Its totient is φ = 49932777936384.
The previous prime is 100121331133289. The next prime is 100121331133319. The reversal of 100121331133312 is 213331133121001.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100121331133319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131010613 + ... + 131772619.
It is an arithmetic number, because the mean of its divisors is an integer number (3124537603200).
Almost surely, 2100121331133312 is an apocalyptic number.
It is an amenable number.
100121331133312 is a deficient number, since it is larger than the sum of its proper divisors (99849075471488).
100121331133312 is an equidigital number, since it uses as much as digits as its factorization.
100121331133312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764643 (or 764631 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 100121331133312 its reverse (213331133121001), we get a palindrome (313452464254313).
The spelling of 100121331133312 in words is "one hundred trillion, one hundred twenty-one billion, three hundred thirty-one million, one hundred thirty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •