Base | Representation |
---|---|
bin | 1001001100100110100000… |
… | …1100110101100001011000 |
3 | 1022210201002201102202201110 |
4 | 2103021220030311201120 |
5 | 2311134040402211300 |
6 | 33301233555020320 |
7 | 2062401203042103 |
oct | 223115014654130 |
9 | 38721081382643 |
10 | 10112101210200 |
11 | 3249577569490 |
12 | 117396229a6a0 |
13 | 58474aa78072 |
14 | 26d5dd3d573a |
15 | 12808b741550 |
hex | 93268335858 |
10112101210200 has 192 divisors, whose sum is σ = 34199186112000. Its totient is φ = 2451282393600.
The previous prime is 10112101210171. The next prime is 10112101210217. The reversal of 10112101210200 is 201210121101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 170930226 + ... + 170989374.
It is an arithmetic number, because the mean of its divisors is an integer number (178120761000).
Almost surely, 210112101210200 is an apocalyptic number.
10112101210200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112101210200 is an abundant number, since it is smaller than the sum of its proper divisors (24087084901800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112101210200 is a wasteful number, since it uses less digits than its factorization.
10112101210200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85082 (or 85073 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10112101210200 its reverse (201210121101), we get a palindrome (10313311331301).
It can be divided in two parts, 10112101 and 210200, that added together give a palindrome (10322301).
The spelling of 10112101210200 in words is "ten trillion, one hundred twelve billion, one hundred one million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •