Base | Representation |
---|---|
bin | 110101000011010100… |
… | …100110000001110101 |
3 | 12110000220220102010020 |
4 | 311003110212001311 |
5 | 1413130244000330 |
6 | 42100253115353 |
7 | 4054423260450 |
oct | 650324460165 |
9 | 173026812106 |
10 | 56964046965 |
11 | 221817a0671 |
12 | b059188b59 |
13 | 54aa798187 |
14 | 2a855ac497 |
15 | 1735e5b210 |
hex | d43526075 |
56964046965 has 64 divisors (see below), whose sum is σ = 110731069440. Its totient is φ = 24425798400.
The previous prime is 56964046957. The next prime is 56964046973.
56964046965 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (56964046957) and next prime (56964046973).
It is not a de Polignac number, because 56964046965 - 23 = 56964046957 is a prime.
It is a super-4 number, since 4×569640469654 (a number of 44 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 56964046899 and 56964046908.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 60142 + ... + 342848.
It is an arithmetic number, because the mean of its divisors is an integer number (1730172960).
Almost surely, 256964046965 is an apocalyptic number.
It is an amenable number.
56964046965 is a deficient number, since it is larger than the sum of its proper divisors (53767022475).
56964046965 is a wasteful number, since it uses less digits than its factorization.
56964046965 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282842.
The product of its (nonzero) digits is 41990400, while the sum is 60.
It can be divided in two parts, 569640 and 46965, that added together give a triangular number (616605 = T1110).
The spelling of 56964046965 in words is "fifty-six billion, nine hundred sixty-four million, forty-six thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •