Base | Representation |
---|---|
bin | 10101001001011010000000… |
… | …00011011110010000111001 |
3 | 20002122121120010001011102222 |
4 | 22210231000003132100321 |
5 | 22043400000001103014 |
6 | 242523012215333425 |
7 | 12536464620263021 |
oct | 1244550003362071 |
9 | 202577503034388 |
10 | 46502685566009 |
11 | 138a9750752462 |
12 | 5270647381275 |
13 | 1cc4252276c2a |
14 | b6aa56044a81 |
15 | 55999546b08e |
hex | 2a4b400de439 |
46502685566009 has 2 divisors, whose sum is σ = 46502685566010. Its totient is φ = 46502685566008.
The previous prime is 46502685565981. The next prime is 46502685566033. The reversal of 46502685566009 is 90066558620564.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27137431609600 + 19365253956409 = 5209360^2 + 4400597^2 .
It is a cyclic number.
It is not a de Polignac number, because 46502685566009 - 220 = 46502684517433 is a prime.
It is a super-2 number, since 2×465026855660092 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (46502685566609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23251342783004 + 23251342783005.
It is an arithmetic number, because the mean of its divisors is an integer number (23251342783005).
Almost surely, 246502685566009 is an apocalyptic number.
It is an amenable number.
46502685566009 is a deficient number, since it is larger than the sum of its proper divisors (1).
46502685566009 is an equidigital number, since it uses as much as digits as its factorization.
46502685566009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312000, while the sum is 62.
The spelling of 46502685566009 in words is "forty-six trillion, five hundred two billion, six hundred eighty-five million, five hundred sixty-six thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •