Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …1011101100001100010100 |
3 | 1022211122222000122000101212 |
4 | 2103102331123230030110 |
5 | 2311320101000231400 |
6 | 33310012132040552 |
7 | 2063204411522660 |
oct | 223227533541424 |
9 | 38748860560355 |
10 | 10122121102100 |
11 | 325284952a587 |
12 | 1175899a63158 |
13 | 58568690b697 |
14 | 26dcb00558a0 |
15 | 12847622d335 |
hex | 934bd6ec314 |
10122121102100 has 72 divisors (see below), whose sum is σ = 26424063543360. Its totient is φ = 3287786699520.
The previous prime is 10122121102073. The next prime is 10122121102117. The reversal of 10122121102100 is 120112122101.
10122121102100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 380517569 + ... + 380544168.
Almost surely, 210122121102100 is an apocalyptic number.
10122121102100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10122121102100 is an abundant number, since it is smaller than the sum of its proper divisors (16301942441260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122121102100 is a wasteful number, since it uses less digits than its factorization.
10122121102100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 761061777 (or 761061770 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10122121102100 its reverse (120112122101), we get a palindrome (10242233224201).
The spelling of 10122121102100 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty-one million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •