Base | Representation |
---|---|
bin | 100010011101101110101101… |
… | …110111001000101101000100 |
3 | 201212200120201102010002221012 |
4 | 202131232231313020231010 |
5 | 124331412343041130301 |
6 | 1254213155435541352 |
7 | 43633022433435560 |
oct | 4235565567105504 |
9 | 655616642102835 |
10 | 151576607755076 |
11 | 4432a307535929 |
12 | 1500068b2ba858 |
13 | 66767c73782ba |
14 | 29604c00b26a0 |
15 | 127ccc7072ebb |
hex | 89dbaddc8b44 |
151576607755076 has 12 divisors (see below), whose sum is σ = 303153215510208. Its totient is φ = 64961403323592.
The previous prime is 151576607755033. The next prime is 151576607755109. The reversal of 151576607755076 is 670557706675151.
151576607755076 is an admirable number.
It is a hoax number, since the sum of its digits (68) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 151576607754997 and 151576607755015.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2706725138456 + ... + 2706725138511.
It is an arithmetic number, because the mean of its divisors is an integer number (25262767959184).
Almost surely, 2151576607755076 is an apocalyptic number.
It is an amenable number.
151576607755076 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151576607755076 is a wasteful number, since it uses less digits than its factorization.
151576607755076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5413450276978 (or 5413450276976 counting only the distinct ones).
The product of its (nonzero) digits is 324135000, while the sum is 68.
The spelling of 151576607755076 in words is "one hundred fifty-one trillion, five hundred seventy-six billion, six hundred seven million, seven hundred fifty-five thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •