Base | Representation |
---|---|
bin | 110100000101110011… |
… | …100000011101100111 |
3 | 12100100222212010102001 |
4 | 310011303200131213 |
5 | 1404022040310424 |
6 | 41410024030131 |
7 | 4020021562135 |
oct | 640563403547 |
9 | 170328763361 |
10 | 55931963239 |
11 | 217a2153909 |
12 | aa0b602347 |
13 | 5374a06749 |
14 | 29c84ac755 |
15 | 16c553d844 |
hex | d05ce0767 |
55931963239 has 4 divisors (see below), whose sum is σ = 55932717280. Its totient is φ = 55931209200.
The previous prime is 55931963189. The next prime is 55931963261. The reversal of 55931963239 is 93236913955.
55931963239 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 55931963239 - 217 = 55931832167 is a prime.
It is a super-2 number, since 2×559319632392 (a number of 22 digits) contains 22 as substring.
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 55931963239.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55931963299) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 251919 + ... + 418720.
It is an arithmetic number, because the mean of its divisors is an integer number (13983179320).
Almost surely, 255931963239 is an apocalyptic number.
55931963239 is a deficient number, since it is larger than the sum of its proper divisors (754041).
55931963239 is an equidigital number, since it uses as much as digits as its factorization.
55931963239 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 754040.
The product of its digits is 5904900, while the sum is 55.
The spelling of 55931963239 in words is "fifty-five billion, nine hundred thirty-one million, nine hundred sixty-three thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •