Base | Representation |
---|---|
bin | 1001001011111101100110… |
… | …1011101010000011010000 |
3 | 1022202122202102202022200212 |
4 | 2102333121223222003100 |
5 | 2310444043233310300 |
6 | 33252220210103252 |
7 | 2061532114103432 |
oct | 222773153520320 |
9 | 38678672668625 |
10 | 10101120213200 |
11 | 324495202a955 |
12 | 11717b887ab28 |
13 | 5836baa750c3 |
14 | 26cc7ac70652 |
15 | 127b476a7935 |
hex | 92fd9aea0d0 |
10101120213200 has 60 divisors (see below), whose sum is σ = 24832312082688. Its totient is φ = 3946484169600.
The previous prime is 10101120213143. The next prime is 10101120213263. The reversal of 10101120213200 is 231202110101.
10101120213200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101011202132002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 293620016 + ... + 293654415.
Almost surely, 210101120213200 is an apocalyptic number.
10101120213200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10101120213200 is an abundant number, since it is smaller than the sum of its proper divisors (14731191869488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101120213200 is a wasteful number, since it uses less digits than its factorization.
10101120213200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 587274492 (or 587274481 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10101120213200 its reverse (231202110101), we get a palindrome (10332322323301).
The spelling of 10101120213200 in words is "ten trillion, one hundred one billion, one hundred twenty million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •