Base | Representation |
---|---|
bin | 1001000110110001111110… |
… | …1010111010011010110010 |
3 | 1022110010222110201112021200 |
4 | 2101230133222322122302 |
5 | 2303014240112010002 |
6 | 33143254552232030 |
7 | 2052231113522034 |
oct | 221543752723262 |
9 | 38403873645250 |
10 | 10012100110002 |
11 | 3210120551831 |
12 | 11584b409b616 |
13 | 5781a1c71923 |
14 | 268834169c54 |
15 | 12568738ab1c |
hex | 91b1faba6b2 |
10012100110002 has 12 divisors (see below), whose sum is σ = 21692883571710. Its totient is φ = 3337366703328.
The previous prime is 10012100109911. The next prime is 10012100110007. The reversal of 10012100110002 is 20001100121001.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 8526989850201 + 1485110259801 = 2920101^2 + 1218651^2 .
It is a super-2 number, since 2×100121001100022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10012100110007) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 278113891927 + ... + 278113891962.
Almost surely, 210012100110002 is an apocalyptic number.
10012100110002 is an abundant number, since it is smaller than the sum of its proper divisors (11680783461708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012100110002 is a wasteful number, since it uses less digits than its factorization.
10012100110002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 556227783897 (or 556227783894 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10012100110002 its reverse (20001100121001), we get a palindrome (30013200231003).
The spelling of 10012100110002 in words is "ten trillion, twelve billion, one hundred million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •