Base | Representation |
---|---|
bin | 110101000010101010… |
… | …100101110010111101 |
3 | 12110000011011222212102 |
4 | 311002222211302331 |
5 | 1413114434122330 |
6 | 42055221114445 |
7 | 4054230550430 |
oct | 650252456275 |
9 | 173004158772 |
10 | 56953035965 |
11 | 2217655a971 |
12 | b055558a25 |
13 | 54a84113a7 |
14 | 2a83d43817 |
15 | 1734ed3945 |
hex | d42aa5cbd |
56953035965 has 32 divisors (see below), whose sum is σ = 81547001856. Its totient is φ = 37335355200.
The previous prime is 56953035941. The next prime is 56953035973.
56953035965 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56953035965 - 212 = 56953031869 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 56953035965.
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 31 ways as a sum of consecutive naturals, for example, 1552424 + ... + 1588686.
It is an arithmetic number, because the mean of its divisors is an integer number (2548343808).
Almost surely, 256953035965 is an apocalyptic number.
It is an amenable number.
56953035965 is a deficient number, since it is larger than the sum of its proper divisors (24593965891).
56953035965 is a wasteful number, since it uses less digits than its factorization.
56953035965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38249.
The product of its (nonzero) digits is 16402500, while the sum is 56.
The spelling of 56953035965 in words is "fifty-six billion, nine hundred fifty-three million, thirty-five thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •