Base | Representation |
---|---|
bin | 10110111010100000… |
… | …11101001101000101 |
3 | 1011202100102000122111 |
4 | 23131100131031011 |
5 | 200143303411003 |
6 | 5352414501021 |
7 | 613566246565 |
oct | 133520351505 |
9 | 34670360574 |
10 | 12302013253 |
11 | 5243190702 |
12 | 2473b04771 |
13 | 12108b8aaa |
14 | 849b96da5 |
15 | 4c002ae6d |
hex | 2dd41d345 |
12302013253 has 2 divisors, whose sum is σ = 12302013254. Its totient is φ = 12302013252.
The previous prime is 12302013187. The next prime is 12302013271. The reversal of 12302013253 is 35231020321.
12302013253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12277083204 + 24930049 = 110802^2 + 4993^2 .
It is a cyclic number.
It is not a de Polignac number, because 12302013253 - 29 = 12302012741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12302013853) 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 as a sum of consecutive naturals, namely, 6151006626 + 6151006627.
It is an arithmetic number, because the mean of its divisors is an integer number (6151006627).
Almost surely, 212302013253 is an apocalyptic number.
It is an amenable number.
12302013253 is a deficient number, since it is larger than the sum of its proper divisors (1).
12302013253 is an equidigital number, since it uses as much as digits as its factorization.
12302013253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 22.
Adding to 12302013253 its reverse (35231020321), we get a palindrome (47533033574).
The spelling of 12302013253 in words is "twelve billion, three hundred two million, thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •