Base | Representation |
---|---|
bin | 1001001100000001101101… |
… | …0011010000001011000000 |
3 | 1022202202121011021202221111 |
4 | 2103000123103100023000 |
5 | 2311003322101041000 |
6 | 33252521334133104 |
7 | 2061601312432063 |
oct | 223003323201300 |
9 | 38682534252844 |
10 | 10102221112000 |
11 | 32453674a9476 |
12 | 1171a654b1194 |
13 | 583834b7bc04 |
14 | 26cd431648da |
15 | 127bae169cba |
hex | 9301b4d02c0 |
10102221112000 has 168 divisors, whose sum is σ = 26404205256000. Its totient is φ = 3828209011200.
The previous prime is 10102221111979. The next prime is 10102221112003. The reversal of 10102221112000 is 21112220101.
It is not an unprimeable number, because it can be changed into a prime (10102221112003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1139001 + ... + 4636999.
Almost surely, 210102221112000 is an apocalyptic number.
10102221112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10102221112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13202102628000).
10102221112000 is an abundant number, since it is smaller than the sum of its proper divisors (16301984144000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102221112000 is an equidigital number, since it uses as much as digits as its factorization.
10102221112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3498064 (or 3498025 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10102221112000 its reverse (21112220101), we get a palindrome (10123333332101).
The spelling of 10102221112000 in words is "ten trillion, one hundred two billion, two hundred twenty-one million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •