Base | Representation |
---|---|
bin | 1000110100100110111… |
… | …1010110101111100011 |
3 | 112111012112202211121111 |
4 | 2031021233112233203 |
5 | 4440344104143201 |
6 | 153343130204151 |
7 | 13643552203210 |
oct | 2151157265743 |
9 | 474175684544 |
10 | 151561006051 |
11 | 593052670a4 |
12 | 25459583657 |
13 | 113a4ab1590 |
14 | 749ac14b07 |
15 | 3e20b79b51 |
hex | 2349bd6be3 |
151561006051 has 32 divisors (see below), whose sum is σ = 187261820928. Its totient is φ = 119450903040.
The previous prime is 151561006043. The next prime is 151561006061. The reversal of 151561006051 is 150600165151.
It is not a de Polignac number, because 151561006051 - 23 = 151561006043 is a prime.
It is a super-2 number, since 2×1515610060512 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (151561006061) 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, 55904586 + ... + 55907296.
It is an arithmetic number, because the mean of its divisors is an integer number (5851931904).
Almost surely, 2151561006051 is an apocalyptic number.
151561006051 is a deficient number, since it is larger than the sum of its proper divisors (35700814877).
151561006051 is a wasteful number, since it uses less digits than its factorization.
151561006051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4891.
The product of its (nonzero) digits is 4500, while the sum is 31.
The spelling of 151561006051 in words is "one hundred fifty-one billion, five hundred sixty-one million, six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •