Base | Representation |
---|---|
bin | 110101000011000100101001… |
… | …0101111011001110111001001 |
3 | 2021012010222110022211000002112 |
4 | 1222012021102233121313021 |
5 | 442130010440113133231 |
6 | 4332224024122112105 |
7 | 200166560160621542 |
oct | 15206112257316711 |
9 | 2235128408730075 |
10 | 466615225130441 |
11 | 125750450a52582 |
12 | 444011a694b635 |
13 | 1704981c47824a |
14 | 83324240bd4c9 |
15 | 38e2aed46b92b |
hex | 1a86252bd9dc9 |
466615225130441 has 2 divisors, whose sum is σ = 466615225130442. Its totient is φ = 466615225130440.
The previous prime is 466615225130261. The next prime is 466615225130447. The reversal of 466615225130441 is 144031522516664.
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., 444126963462400 + 22488261668041 = 21074320^2 + 4742179^2 .
It is a cyclic number.
It is not a de Polignac number, because 466615225130441 - 238 = 466340347223497 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 466615225130441.
It is not a weakly prime, because it can be changed into another prime (466615225130447) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 233307612565220 + 233307612565221.
It is an arithmetic number, because the mean of its divisors is an integer number (233307612565221).
Almost surely, 2466615225130441 is an apocalyptic number.
It is an amenable number.
466615225130441 is a deficient number, since it is larger than the sum of its proper divisors (1).
466615225130441 is an equidigital number, since it uses as much as digits as its factorization.
466615225130441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4147200, while the sum is 50.
The spelling of 466615225130441 in words is "four hundred sixty-six trillion, six hundred fifteen billion, two hundred twenty-five million, one hundred thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •