Base | Representation |
---|---|
bin | 1001000110101101111011… |
… | …0100000110100101100101 |
3 | 1022110001011122020211002222 |
4 | 2101223132310012211211 |
5 | 2303010023033000401 |
6 | 33142555002242125 |
7 | 2052162131660000 |
oct | 221533664064545 |
9 | 38401148224088 |
10 | 10011012000101 |
11 | 320a712318752 |
12 | 115824b7b6345 |
13 | 57805a6c4c08 |
14 | 26876d844537 |
15 | 125621aa2c1b |
hex | 91aded06965 |
10011012000101 has 20 divisors (see below), whose sum is σ = 12055555269504. Its totient is φ = 8304065191800.
The previous prime is 10011012000091. The next prime is 10011012000109. The reversal of 10011012000101 is 10100021011001.
It is a happy number.
10011012000101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10011012000101 - 230 = 10009938258277 is a prime.
It is a super-2 number, since 2×100110120001012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011012000109) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 67175855 + ... + 67324716.
Almost surely, 210011012000101 is an apocalyptic number.
It is an amenable number.
10011012000101 is a deficient number, since it is larger than the sum of its proper divisors (2044543269403).
10011012000101 is an frugal number, since it uses more digits than its factorization.
10011012000101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134500630 (or 134500609 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10011012000101 its reverse (10100021011001), we get a palindrome (20111033011102).
The spelling of 10011012000101 in words is "ten trillion, eleven billion, twelve million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •