Base | Representation |
---|---|
bin | 110100010011010010… |
… | …101011100001101111 |
3 | 12100221202122010011112 |
4 | 310103102223201233 |
5 | 1410003002120311 |
6 | 41444305542235 |
7 | 4025440103552 |
oct | 642322534157 |
9 | 170852563145 |
10 | 56158238831 |
11 | 218a8953032 |
12 | aa7334497b |
13 | 53ac860726 |
14 | 2a0a570699 |
15 | 16da33828b |
hex | d134ab86f |
56158238831 has 4 divisors (see below), whose sum is σ = 56159013000. Its totient is φ = 56157464664.
The previous prime is 56158238767. The next prime is 56158238869. The reversal of 56158238831 is 13883285165.
It is a happy number.
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 56158238831 - 26 = 56158238767 is a prime.
It is a super-2 number, since 2×561582388312 (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 56158238831.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56158238131) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 265556 + ... + 427593.
It is an arithmetic number, because the mean of its divisors is an integer number (14039753250).
Almost surely, 256158238831 is an apocalyptic number.
56158238831 is a deficient number, since it is larger than the sum of its proper divisors (774169).
56158238831 is an equidigital number, since it uses as much as digits as its factorization.
56158238831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774168.
The product of its digits is 1382400, while the sum is 50.
The spelling of 56158238831 in words is "fifty-six billion, one hundred fifty-eight million, two hundred thirty-eight thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •