Base | Representation |
---|---|
bin | 110100001010011101… |
… | …011000101001100111 |
3 | 12100120102210100111220 |
4 | 310022131120221213 |
5 | 1404202033101101 |
6 | 41421453431423 |
7 | 4021660366566 |
oct | 641235305147 |
9 | 170512710456 |
10 | 56010050151 |
11 | 21832238750 |
12 | aa3179b573 |
13 | 5387c47113 |
14 | 29d49d7bdd |
15 | 16cc315636 |
hex | d0a758a67 |
56010050151 has 32 divisors (see below), whose sum is σ = 81717984000. Its totient is φ = 33841985280.
The previous prime is 56010050113. The next prime is 56010050167. The reversal of 56010050151 is 15105001065.
56010050151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56010050151 - 27 = 56010050023 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56010050651) 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, 20750800 + ... + 20753498.
It is an arithmetic number, because the mean of its divisors is an integer number (2553687000).
Almost surely, 256010050151 is an apocalyptic number.
56010050151 is a deficient number, since it is larger than the sum of its proper divisors (25707933849).
56010050151 is a wasteful number, since it uses less digits than its factorization.
56010050151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4399.
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 56010050151 in words is "fifty-six billion, ten million, fifty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •