Base | Representation |
---|---|
bin | 110100010010110111… |
… | …101011110100000001 |
3 | 12100221021022120201212 |
4 | 310102313223310001 |
5 | 1404444144141423 |
6 | 41443454135505 |
7 | 4025323000664 |
oct | 642267536401 |
9 | 170837276655 |
10 | 56151162113 |
11 | 218a495a202 |
12 | aa70ab1595 |
13 | 53ab253617 |
14 | 2a0964b6db |
15 | 16d98db578 |
hex | d12debd01 |
56151162113 has 8 divisors (see below), whose sum is σ = 56560416000. Its totient is φ = 55742340528.
The previous prime is 56151162047. The next prime is 56151162131. The reversal of 56151162113 is 31126115165.
56151162113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56151162113 - 212 = 56151158017 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 56151162113.
It is not an unprimeable number, because it can be changed into a prime (56151162173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154970 + ... + 369212.
It is an arithmetic number, because the mean of its divisors is an integer number (7070052000).
Almost surely, 256151162113 is an apocalyptic number.
It is an amenable number.
56151162113 is a deficient number, since it is larger than the sum of its proper divisors (409253887).
56151162113 is a wasteful number, since it uses less digits than its factorization.
56151162113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 216151.
The product of its digits is 5400, while the sum is 32.
Adding to 56151162113 its reverse (31126115165), we get a palindrome (87277277278).
The spelling of 56151162113 in words is "fifty-six billion, one hundred fifty-one million, one hundred sixty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •