Base | Representation |
---|---|
bin | 101101101111111111100000… |
… | …100110100100010000110100 |
3 | 222101102111102220101100010012 |
4 | 231233333200212210100310 |
5 | 202333111241341401400 |
6 | 1551534351104115352 |
7 | 60244643610200240 |
oct | 5557774046442064 |
9 | 871374386340105 |
10 | 201210101122100 |
11 | 591257a7601a34 |
12 | 1a697a47905b58 |
13 | 88370534ab4c5 |
14 | 37988998b5420 |
15 | 183de0a95ed35 |
hex | b6ffe09a4434 |
201210101122100 has 72 divisors (see below), whose sum is σ = 528354053801280. Its totient is φ = 64928301534720.
The previous prime is 201210101122057. The next prime is 201210101122157. The reversal of 201210101122100 is 1221101012102.
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, 8454194030 + ... + 8454217829.
It is an arithmetic number, because the mean of its divisors is an integer number (7338250747240).
Almost surely, 2201210101122100 is an apocalyptic number.
201210101122100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201210101122100 is an abundant number, since it is smaller than the sum of its proper divisors (327143952679180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201210101122100 is a wasteful number, since it uses less digits than its factorization.
201210101122100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16908411897 (or 16908411890 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201210101122100 its reverse (1221101012102), we get a palindrome (202431202134202).
The spelling of 201210101122100 in words is "two hundred one trillion, two hundred ten billion, one hundred one million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •