Base | Representation |
---|---|
bin | 1011111111110101101… |
… | …00101111000001100101 |
3 | 1110102001000111211010202 |
4 | 11333322310233001211 |
5 | 23223221341134341 |
6 | 513213104000245 |
7 | 41532305236364 |
oct | 5777264570145 |
9 | 1412030454122 |
10 | 412230021221 |
11 | 14990a111357 |
12 | 67a87000085 |
13 | 2cb4733b9a5 |
14 | 15d485797db |
15 | aaca45379b |
hex | 5ffad2f065 |
412230021221 has 2 divisors, whose sum is σ = 412230021222. Its totient is φ = 412230021220.
The previous prime is 412230021191. The next prime is 412230021323. The reversal of 412230021221 is 122120032214.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 336046293025 + 76183728196 = 579695^2 + 276014^2 .
It is a cyclic number.
It is not a de Polignac number, because 412230021221 - 218 = 412229759077 is a prime.
It is a super-2 number, since 2×4122300212212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 412230021193 and 412230021202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (412230029221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206115010610 + 206115010611.
It is an arithmetic number, because the mean of its divisors is an integer number (206115010611).
Almost surely, 2412230021221 is an apocalyptic number.
It is an amenable number.
412230021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
412230021221 is an equidigital number, since it uses as much as digits as its factorization.
412230021221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 412230021221 its reverse (122120032214), we get a palindrome (534350053435).
The spelling of 412230021221 in words is "four hundred twelve billion, two hundred thirty million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •