Base | Representation |
---|---|
bin | 10110101110101110… |
… | …01010111110011101 |
3 | 1011111110022020022012 |
4 | 23113113022332131 |
5 | 144442444012201 |
6 | 5334523001005 |
7 | 611255504024 |
oct | 132727127635 |
9 | 34443266265 |
10 | 12203110301 |
11 | 51a2379428 |
12 | 2446969165 |
13 | 11c626a735 |
14 | 83a9ad8bb |
15 | 4b64e15bb |
hex | 2d75caf9d |
12203110301 has 4 divisors (see below), whose sum is σ = 12207126204. Its totient is φ = 12199094400.
The previous prime is 12203110247. The next prime is 12203110363. The reversal of 12203110301 is 10301130221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10301130221 = 23 ⋅447875227.
It can be written as a sum of positive squares in 2 ways, for example, as 6427870276 + 5775240025 = 80174^2 + 75995^2 .
It is a cyclic number.
It is not a de Polignac number, because 12203110301 - 26 = 12203110237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203110201) 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, 2003390 + ... + 2009471.
It is an arithmetic number, because the mean of its divisors is an integer number (3051781551).
Almost surely, 212203110301 is an apocalyptic number.
It is an amenable number.
12203110301 is a deficient number, since it is larger than the sum of its proper divisors (4015903).
12203110301 is an equidigital number, since it uses as much as digits as its factorization.
12203110301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4015902.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 12203110301 its reverse (10301130221), we get a palindrome (22504240522).
The spelling of 12203110301 in words is "twelve billion, two hundred three million, one hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •