Base | Representation |
---|---|
bin | 110100100110011100… |
… | …111100101000111001 |
3 | 12101210011111220111212 |
4 | 310212130330220321 |
5 | 1411132300304330 |
6 | 41540231532505 |
7 | 4036422336002 |
oct | 644634745071 |
9 | 171704456455 |
10 | 56479697465 |
11 | 21a53353724 |
12 | ab42b2a135 |
13 | 5431332839 |
14 | 2a3b12c1a9 |
15 | 1708685295 |
hex | d2673ca39 |
56479697465 has 16 divisors (see below), whose sum is σ = 72048372480. Its totient is φ = 42356448000.
The previous prime is 56479697423. The next prime is 56479697513.
56479697465 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-56479697465 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56479697395 and 56479697404.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 1302305 + ... + 1344974.
It is an arithmetic number, because the mean of its divisors is an integer number (4503023280).
Almost surely, 256479697465 is an apocalyptic number.
It is an amenable number.
56479697465 is a deficient number, since it is larger than the sum of its proper divisors (15568675015).
56479697465 is a wasteful number, since it uses less digits than its factorization.
56479697465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2647552.
The product of its digits is 342921600, while the sum is 68.
The spelling of 56479697465 in words is "fifty-six billion, four hundred seventy-nine million, six hundred ninety-seven thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •