Base | Representation |
---|---|
bin | 1001001100100110100000… |
… | …1101010010110100011000 |
3 | 1022210201002201122212022220 |
4 | 2103021220031102310120 |
5 | 2311134040420031300 |
6 | 33301234001344040 |
7 | 2062401204052002 |
oct | 223115015226430 |
9 | 38721081585286 |
10 | 10112101330200 |
11 | 3249577640661 |
12 | 1173962338020 |
13 | 58474aaba87c |
14 | 26d5dd427372 |
15 | 12808b766da0 |
hex | 93268352d18 |
10112101330200 has 48 divisors (see below), whose sum is σ = 31347514125480. Its totient is φ = 2696560354560.
The previous prime is 10112101330181. The next prime is 10112101330211. The reversal of 10112101330200 is 203310121101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10112101330200.
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, 8426750509 + ... + 8426751708.
Almost surely, 210112101330200 is an apocalyptic number.
10112101330200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10112101330200 is an abundant number, since it is smaller than the sum of its proper divisors (21235412795280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10112101330200 is a wasteful number, since it uses less digits than its factorization.
10112101330200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16853502236 (or 16853502227 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10112101330200 its reverse (203310121101), we get a palindrome (10315411451301).
The spelling of 10112101330200 in words is "ten trillion, one hundred twelve billion, one hundred one million, three hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •