Base | Representation |
---|---|
bin | 1001000110001100101110… |
… | …1100001001001101100000 |
3 | 1022102012011122000212211001 |
4 | 2101203023230021031200 |
5 | 2302333300402241000 |
6 | 33134522445201344 |
7 | 2051425251346642 |
oct | 221431354111540 |
9 | 38365148025731 |
10 | 10002101212000 |
11 | 320695a41a767 |
12 | 1156583560254 |
13 | 57726a57bc31 |
14 | 268166212892 |
15 | 12529e64946a |
hex | 918cbb09360 |
10002101212000 has 48 divisors (see below), whose sum is σ = 24575162687712. Its totient is φ = 4000840483200.
The previous prime is 10002101211967. The next prime is 10002101212007. The reversal of 10002101212000 is 21210120001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002101212007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1250258652 + ... + 1250266651.
It is an arithmetic number, because the mean of its divisors is an integer number (511982555994).
Almost surely, 210002101212000 is an apocalyptic number.
10002101212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10002101212000 is an abundant number, since it is smaller than the sum of its proper divisors (14573061475712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002101212000 is an equidigital number, since it uses as much as digits as its factorization.
10002101212000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2500525328 (or 2500525310 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10002101212000 its reverse (21210120001), we get a palindrome (10023311332001).
The spelling of 10002101212000 in words is "ten trillion, two billion, one hundred one million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •