Base | Representation |
---|---|
bin | 1011111111101000100… |
… | …01001010001111011101 |
3 | 1110101202100112210121002 |
4 | 11333310101022033131 |
5 | 23223010212012341 |
6 | 513154134320045 |
7 | 41526501321632 |
oct | 5776421121735 |
9 | 1411670483532 |
10 | 412120032221 |
11 | 149863017a57 |
12 | 67a561b9025 |
13 | 2cb2a60b641 |
14 | 15d37b08189 |
15 | aac097929b |
hex | 5ff444a3dd |
412120032221 has 2 divisors, whose sum is σ = 412120032222. Its totient is φ = 412120032220.
The previous prime is 412120032211. The next prime is 412120032227. The reversal of 412120032221 is 122230021214.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 398003265625 + 14116766596 = 630875^2 + 118814^2 .
It is a cyclic number.
It is not a de Polignac number, because 412120032221 - 238 = 137242125277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 412120032193 and 412120032202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (412120032227) 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, 206060016110 + 206060016111.
It is an arithmetic number, because the mean of its divisors is an integer number (206060016111).
Almost surely, 2412120032221 is an apocalyptic number.
It is an amenable number.
412120032221 is a deficient number, since it is larger than the sum of its proper divisors (1).
412120032221 is an equidigital number, since it uses as much as digits as its factorization.
412120032221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 412120032221 its reverse (122230021214), we get a palindrome (534350053435).
The spelling of 412120032221 in words is "four hundred twelve billion, one hundred twenty million, thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •