Base | Representation |
---|---|
bin | 110101000011110000… |
… | …101101100101101101 |
3 | 12110001102202220020020 |
4 | 311003300231211231 |
5 | 1413134140333330 |
6 | 42101115112353 |
7 | 4054543030320 |
oct | 650360554555 |
9 | 173042686206 |
10 | 56971417965 |
11 | 22185975600 |
12 | b05b7426b9 |
13 | 54ac179207 |
14 | 2a8656a7b7 |
15 | 1736915210 |
hex | d43c2d96d |
56971417965 has 96 divisors (see below), whose sum is σ = 114675740928. Its totient is φ = 23641728000.
The previous prime is 56971417871. The next prime is 56971417981.
56971417965 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56971417965 - 29 = 56971417453 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 56971417899 and 56971417908.
It is a congruent number.
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 95 ways as a sum of consecutive naturals, for example, 9818065 + ... + 9823865.
It is an arithmetic number, because the mean of its divisors is an integer number (1194538968).
Almost surely, 256971417965 is an apocalyptic number.
56971417965 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
56971417965 is an abundant number, since it is smaller than the sum of its proper divisors (57704322963).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56971417965 is a wasteful number, since it uses less digits than its factorization.
56971417965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6611 (or 6600 counting only the distinct ones).
The product of its digits is 14288400, while the sum is 60.
The spelling of 56971417965 in words is "fifty-six billion, nine hundred seventy-one million, four hundred seventeen thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •