Base | Representation |
---|---|
bin | 10110010110101010… |
… | …10100111010000101 |
3 | 1010222101120012202100 |
4 | 23023111110322011 |
5 | 144034313100401 |
6 | 5302513302313 |
7 | 603255240060 |
oct | 131325247205 |
9 | 33871505670 |
10 | 12001300101 |
11 | 50a946a43a |
12 | 23ab264999 |
13 | 11934cb50b |
14 | 81bc798d7 |
15 | 4a392ab86 |
hex | 2cb554e85 |
12001300101 has 24 divisors (see below), whose sum is σ = 19819317440. Its totient is φ = 6855238656.
The previous prime is 12001300067. The next prime is 12001300123. The reversal of 12001300101 is 10100310021.
12001300101 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 12001300101 - 217 = 12001169029 is a prime.
It is a super-2 number, since 2×120013001012 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001300151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 133986 + ... + 204828.
Almost surely, 212001300101 is an apocalyptic number.
It is an amenable number.
12001300101 is a deficient number, since it is larger than the sum of its proper divisors (7818017339).
12001300101 is a wasteful number, since it uses less digits than its factorization.
12001300101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73545 (or 73542 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 12001300101 its reverse (10100310021), we get a palindrome (22101610122).
The spelling of 12001300101 in words is "twelve billion, one million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.356 sec. • engine limits •