Base | Representation |
---|---|
bin | 10110110010000111011101… |
… | …000001001010111100111010 |
3 | 111010210010021222111120200010 |
4 | 112302013131001022330322 |
5 | 101113143122012320442 |
6 | 553035412020522350 |
7 | 30051166123030326 |
oct | 2662073501127472 |
9 | 433703258446603 |
10 | 100201000120122 |
11 | 29a22007373430 |
12 | b2a37602503b6 |
13 | 43babb5714b75 |
14 | 1aa5a7ba72986 |
15 | b8b6d094ab9c |
hex | 5b21dd04af3a |
100201000120122 has 64 divisors (see below), whose sum is σ = 228992995731456. Its totient is φ = 28933335456960.
The previous prime is 100201000120103. The next prime is 100201000120127. The reversal of 100201000120122 is 221021000102001.
100201000120122 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 100201000120098 and 100201000120107.
It is not an unprimeable number, because it can be changed into a prime (100201000120127) 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, 125092333 + ... + 125890800.
It is an arithmetic number, because the mean of its divisors is an integer number (3578015558304).
Almost surely, 2100201000120122 is an apocalyptic number.
100201000120122 is an abundant number, since it is smaller than the sum of its proper divisors (128791995611334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201000120122 is a wasteful number, since it uses less digits than its factorization.
100201000120122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250983435.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100201000120122 its reverse (221021000102001), we get a palindrome (321222000222123).
The spelling of 100201000120122 in words is "one hundred trillion, two hundred one billion, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •