Base | Representation |
---|---|
bin | 1001001011111001110011… |
… | …1100000101100011111100 |
3 | 1022202120010102010111221100 |
4 | 2102332130330011203330 |
5 | 2310440001341010022 |
6 | 33251531123133100 |
7 | 2061464630630214 |
oct | 222763474054374 |
9 | 38676112114840 |
10 | 10100101110012 |
11 | 3244479849611 |
12 | 1171573514190 |
13 | 5835878a9a74 |
14 | 26cbc178d244 |
15 | 127ad7ea11ac |
hex | 92f9cf058fc |
10100101110012 has 72 divisors (see below), whose sum is σ = 27600876976400. Its totient is φ = 3103302751488.
The previous prime is 10100101109999. The next prime is 10100101110017. The reversal of 10100101110012 is 21001110100101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10100101109976 and 10100101110003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10100101110017) 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, 199518337 + ... + 199568952.
Almost surely, 210100101110012 is an apocalyptic number.
10100101110012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10100101110012 is an abundant number, since it is smaller than the sum of its proper divisors (17500775866388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100101110012 is a wasteful number, since it uses less digits than its factorization.
10100101110012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 399087355 (or 399087350 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10100101110012 its reverse (21001110100101), we get a palindrome (31101211210113).
The spelling of 10100101110012 in words is "ten trillion, one hundred billion, one hundred one million, one hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •