Base | Representation |
---|---|
bin | 10111011000110110… |
… | …00111100000100101 |
3 | 1012102002012120111012 |
4 | 23230123013200211 |
5 | 201203423404323 |
6 | 5433544352005 |
7 | 623106126134 |
oct | 135433074045 |
9 | 35362176435 |
10 | 12556466213 |
11 | 5363885a05 |
12 | 2525175605 |
13 | 125152a285 |
14 | 8718b191b |
15 | 4d753e678 |
hex | 2ec6c7825 |
12556466213 has 2 divisors, whose sum is σ = 12556466214. Its totient is φ = 12556466212.
The previous prime is 12556466201. The next prime is 12556466239. The reversal of 12556466213 is 31266465521.
It is a happy number.
12556466213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12241652164 + 314814049 = 110642^2 + 17743^2 .
It is a cyclic number.
It is not a de Polignac number, because 12556466213 - 26 = 12556466149 is a prime.
It is a super-2 number, since 2×125564662132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12556466413) 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, 6278233106 + 6278233107.
It is an arithmetic number, because the mean of its divisors is an integer number (6278233107).
Almost surely, 212556466213 is an apocalyptic number.
It is an amenable number.
12556466213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12556466213 is an equidigital number, since it uses as much as digits as its factorization.
12556466213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 259200, while the sum is 41.
The spelling of 12556466213 in words is "twelve billion, five hundred fifty-six million, four hundred sixty-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •