Base | Representation |
---|---|
bin | 1011001100101001110100… |
… | …0111010100100000100101 |
3 | 1121121000110022002201221222 |
4 | 2303022131013110200211 |
5 | 3103210000111243021 |
6 | 42104021010350125 |
7 | 2410341066034016 |
oct | 263123507244045 |
9 | 47530408081858 |
10 | 12312012212261 |
11 | 3a17549a13a53 |
12 | 146a197b8b345 |
13 | 6b403006a7a8 |
14 | 307c941db00d |
15 | 1653e4e636ab |
hex | b329d1d4825 |
12312012212261 has 2 divisors, whose sum is σ = 12312012212262. Its totient is φ = 12312012212260.
The previous prime is 12312012212257. The next prime is 12312012212327. The reversal of 12312012212261 is 16221221021321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7945458675361 + 4366553536900 = 2818769^2 + 2089630^2 .
It is a cyclic number.
It is not a de Polignac number, because 12312012212261 - 22 = 12312012212257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12312012212261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12312072212261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6156006106130 + 6156006106131.
It is an arithmetic number, because the mean of its divisors is an integer number (6156006106131).
Almost surely, 212312012212261 is an apocalyptic number.
It is an amenable number.
12312012212261 is a deficient number, since it is larger than the sum of its proper divisors (1).
12312012212261 is an equidigital number, since it uses as much as digits as its factorization.
12312012212261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 12312012212261 its reverse (16221221021321), we get a palindrome (28533233233582).
The spelling of 12312012212261 in words is "twelve trillion, three hundred twelve billion, twelve million, two hundred twelve thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •