Base | Representation |
---|---|
bin | 100111010011101101111… |
… | …0010100101000101010101 |
3 | 201010110200211011120012212 |
4 | 1032213123302211011111 |
5 | 1202003220102013334 |
6 | 15253505000123205 |
7 | 1065213012611165 |
oct | 116473362450525 |
9 | 21113624146185 |
10 | 5402461360469 |
11 | 17a3197661468 |
12 | 733049466505 |
13 | 3025b0623504 |
14 | 1496a27bc5a5 |
15 | 957e5261ece |
hex | 4e9dbca5155 |
5402461360469 has 2 divisors, whose sum is σ = 5402461360470. Its totient is φ = 5402461360468.
The previous prime is 5402461360459. The next prime is 5402461360567. The reversal of 5402461360469 is 9640631642045.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4668680668369 + 733780692100 = 2160713^2 + 856610^2 .
It is a cyclic number.
It is not a de Polignac number, because 5402461360469 - 24 = 5402461360453 is a prime.
It is a super-2 number, since 2×54024613604692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5402461360409) 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, 2701230680234 + 2701230680235.
It is an arithmetic number, because the mean of its divisors is an integer number (2701230680235).
Almost surely, 25402461360469 is an apocalyptic number.
It is an amenable number.
5402461360469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5402461360469 is an equidigital number, since it uses as much as digits as its factorization.
5402461360469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 50.
The spelling of 5402461360469 in words is "five trillion, four hundred two billion, four hundred sixty-one million, three hundred sixty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •