Base | Representation |
---|---|
bin | 110100000111010010… |
… | …000100000011100111 |
3 | 12100102201111110020020 |
4 | 310013102010003213 |
5 | 1404044412004232 |
6 | 41412311210223 |
7 | 4020442350324 |
oct | 640722040347 |
9 | 170381443206 |
10 | 55956750567 |
11 | 21805143a03 |
12 | aa17976973 |
13 | 5379ba4bc3 |
14 | 29cb8c1b4b |
15 | 16c77d7e2c |
hex | d074840e7 |
55956750567 has 32 divisors (see below), whose sum is σ = 79152353280. Its totient is φ = 35104903680.
The previous prime is 55956750547. The next prime is 55956750581. The reversal of 55956750567 is 76505765955.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-55956750567 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55956750567.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55956750547) 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, 957058 + ... + 1013840.
It is an arithmetic number, because the mean of its divisors is an integer number (2473511040).
Almost surely, 255956750567 is an apocalyptic number.
55956750567 is a deficient number, since it is larger than the sum of its proper divisors (23195602713).
55956750567 is a wasteful number, since it uses less digits than its factorization.
55956750567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57103.
The product of its (nonzero) digits is 49612500, while the sum is 60.
The spelling of 55956750567 in words is "fifty-five billion, nine hundred fifty-six million, seven hundred fifty thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •