Base | Representation |
---|---|
bin | 10110110001111110… |
… | …11010000110000001 |
3 | 1011120100201111000112 |
4 | 23120333122012001 |
5 | 200021442411301 |
6 | 5341340401105 |
7 | 612036661325 |
oct | 133077320601 |
9 | 34510644015 |
10 | 12230435201 |
11 | 5206841a96 |
12 | 2453b46195 |
13 | 11cbb16c0a |
14 | 840483985 |
15 | 4b8adc9bb |
hex | 2d8fda181 |
12230435201 has 2 divisors, whose sum is σ = 12230435202. Its totient is φ = 12230435200.
The previous prime is 12230435197. The next prime is 12230435207. The reversal of 12230435201 is 10253403221.
12230435201 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., 12160796176 + 69639025 = 110276^2 + 8345^2 .
It is a cyclic number.
It is not a de Polignac number, because 12230435201 - 22 = 12230435197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12230435207) 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, 6115217600 + 6115217601.
It is an arithmetic number, because the mean of its divisors is an integer number (6115217601).
Almost surely, 212230435201 is an apocalyptic number.
It is an amenable number.
12230435201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12230435201 is an equidigital number, since it uses as much as digits as its factorization.
12230435201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 12230435201 its reverse (10253403221), we get a palindrome (22483838422).
The spelling of 12230435201 in words is "twelve billion, two hundred thirty million, four hundred thirty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •