Base | Representation |
---|---|
bin | 110100100101110100… |
… | …100000100000010001 |
3 | 12101202102120022200020 |
4 | 310211310200200101 |
5 | 1411122042041330 |
6 | 41535212414053 |
7 | 4036233254205 |
oct | 644564404021 |
9 | 171672508606 |
10 | 56469096465 |
11 | 21a48372a71 |
12 | ab3b477329 |
13 | 542c090562 |
14 | 2a3996cb05 |
15 | 170778e210 |
hex | d25d20811 |
56469096465 has 32 divisors (see below), whose sum is σ = 92131243776. Its totient is φ = 29529081600.
The previous prime is 56469096457. The next prime is 56469096493.
56469096465 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56469096465 - 23 = 56469096457 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 56469096399 and 56469096408.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24894 + ... + 336983.
It is an arithmetic number, because the mean of its divisors is an integer number (2879101368).
Almost surely, 256469096465 is an apocalyptic number.
It is an amenable number.
56469096465 is a deficient number, since it is larger than the sum of its proper divisors (35662147311).
56469096465 is a wasteful number, since it uses less digits than its factorization.
56469096465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362089.
The product of its (nonzero) digits is 41990400, while the sum is 60.
The spelling of 56469096465 in words is "fifty-six billion, four hundred sixty-nine million, ninety-six thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •