Base | Representation |
---|---|
bin | 110101000011011101… |
… | …000100000001010101 |
3 | 12110001002002012101110 |
4 | 311003131010001111 |
5 | 1413131331020330 |
6 | 42100412445233 |
7 | 4054451164656 |
oct | 650335040125 |
9 | 173032065343 |
10 | 56966266965 |
11 | 22182a77583 |
12 | b059a79819 |
13 | 54ab09479a |
14 | 2a859c952d |
15 | 1736248db0 |
hex | d43744055 |
56966266965 has 32 divisors (see below), whose sum is σ = 94573863936. Its totient is φ = 29249556480.
The previous prime is 56966266961. The next prime is 56966266979.
56966266965 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 56966266965 - 22 = 56966266961 is a prime.
It is a super-2 number, since 2×569662669652 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56966266896 and 56966266905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56966266961) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 227634 + ... + 407123.
It is an arithmetic number, because the mean of its divisors is an integer number (2955433248).
Almost surely, 256966266965 is an apocalyptic number.
It is an amenable number.
56966266965 is a deficient number, since it is larger than the sum of its proper divisors (37607596971).
56966266965 is a wasteful number, since it uses less digits than its factorization.
56966266965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634989.
The product of its digits is 188956800, while the sum is 66.
The spelling of 56966266965 in words is "fifty-six billion, nine hundred sixty-six million, two hundred sixty-six thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •