Base | Representation |
---|---|
bin | 1001001011111001110110… |
… | …0110000000101010100001 |
3 | 1022202120011011210212100222 |
4 | 2102332131212000222201 |
5 | 2310440012144200001 |
6 | 33251532154452425 |
7 | 2061465123222050 |
oct | 222763546005241 |
9 | 38676134725328 |
10 | 10100112100001 |
11 | 3244484a75550 |
12 | 1171577134115 |
13 | 583589c57111 |
14 | 26cbc3010397 |
15 | 127ad8e2261b |
hex | 92f9d980aa1 |
10100112100001 has 128 divisors (see below), whose sum is σ = 13361802854400. Its totient is φ = 7407832320000.
The previous prime is 10100112099989. The next prime is 10100112100003. The reversal of 10100112100001 is 10000121100101.
It is a happy number.
It is not a de Polignac number, because 10100112100001 - 210 = 10100112098977 is a prime.
It is a super-2 number, since 2×101001121000012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10100112100003) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9720992840 + ... + 9720993878.
It is an arithmetic number, because the mean of its divisors is an integer number (104389084800).
Almost surely, 210100112100001 is an apocalyptic number.
10100112100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10100112100001 is a deficient number, since it is larger than the sum of its proper divisors (3261690754399).
10100112100001 is a wasteful number, since it uses less digits than its factorization.
10100112100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1951.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10100112100001 its reverse (10000121100101), we get a palindrome (20100233200102).
The spelling of 10100112100001 in words is "ten trillion, one hundred billion, one hundred twelve million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •