Base | Representation |
---|---|
bin | 1011111111101001000… |
… | …00110111100111000101 |
3 | 1110101202122022000102022 |
4 | 11333310200313213011 |
5 | 23223012240301323 |
6 | 513154402452525 |
7 | 41526551322506 |
oct | 5776440674705 |
9 | 1411678260368 |
10 | 412124150213 |
11 | 14986537a956 |
12 | 67a57664145 |
13 | 2cb2b420b19 |
14 | 15d3849abad |
15 | aac0ede4c8 |
hex | 5ff48379c5 |
412124150213 has 2 divisors, whose sum is σ = 412124150214. Its totient is φ = 412124150212.
The previous prime is 412124150189. The next prime is 412124150219. The reversal of 412124150213 is 312051421214.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 219457582369 + 192666567844 = 468463^2 + 438938^2 .
It is a cyclic number.
It is not a de Polignac number, because 412124150213 - 212 = 412124146117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (412124150219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206062075106 + 206062075107.
It is an arithmetic number, because the mean of its divisors is an integer number (206062075107).
Almost surely, 2412124150213 is an apocalyptic number.
It is an amenable number.
412124150213 is a deficient number, since it is larger than the sum of its proper divisors (1).
412124150213 is an equidigital number, since it uses as much as digits as its factorization.
412124150213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 412124150213 its reverse (312051421214), we get a palindrome (724175571427).
The spelling of 412124150213 in words is "four hundred twelve billion, one hundred twenty-four million, one hundred fifty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •