Base | Representation |
---|---|
bin | 10110100010101011… |
… | …00000100110100101 |
3 | 1011020102001212112210 |
4 | 23101111200212211 |
5 | 144241103330201 |
6 | 5320512034033 |
7 | 605620253532 |
oct | 132125404645 |
9 | 34212055483 |
10 | 12102011301 |
11 | 51502a7236 |
12 | 2418b32919 |
13 | 11ab330943 |
14 | 82b3b3d89 |
15 | 4ac6c11d6 |
hex | 2d15609a5 |
12102011301 has 4 divisors (see below), whose sum is σ = 16136015072. Its totient is φ = 8068007532.
The previous prime is 12102011267. The next prime is 12102011303. The reversal of 12102011301 is 10311020121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10311020121 = 3 ⋅3437006707.
It is not a de Polignac number, because 12102011301 - 26 = 12102011237 is a prime.
It is a super-3 number, since 3×121020113013 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12102011303) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2017001881 + ... + 2017001886.
It is an arithmetic number, because the mean of its divisors is an integer number (4034003768).
Almost surely, 212102011301 is an apocalyptic number.
It is an amenable number.
12102011301 is a deficient number, since it is larger than the sum of its proper divisors (4034003771).
12102011301 is an equidigital number, since it uses as much as digits as its factorization.
12102011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4034003770.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 12102011301 its reverse (10311020121), we get a palindrome (22413031422).
The spelling of 12102011301 in words is "twelve billion, one hundred two million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •