Base | Representation |
---|---|
bin | 1000110010111010101… |
… | …1100010111000111000 |
3 | 112110000220112002002220 |
4 | 2030232223202320320 |
5 | 4433431344204032 |
6 | 153230111524040 |
7 | 13626400332534 |
oct | 2145653427070 |
9 | 473026462086 |
10 | 151107022392 |
11 | 590a1a7a497 |
12 | 25351529620 |
13 | 11331a1b5b1 |
14 | 74567dabc4 |
15 | 3de5da112c |
hex | 232eae2e38 |
151107022392 has 64 divisors (see below), whose sum is σ = 400123994400. Its totient is φ = 47390146560.
The previous prime is 151107022379. The next prime is 151107022399. The reversal of 151107022392 is 293220701151.
151107022392 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151107022399) 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 15 ways as a sum of consecutive naturals, for example, 1179834 + ... + 1301622.
Almost surely, 2151107022392 is an apocalyptic number.
151107022392 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
151107022392 is an abundant number, since it is smaller than the sum of its proper divisors (249016972008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151107022392 is a wasteful number, since it uses less digits than its factorization.
151107022392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124856 (or 124852 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 33.
The spelling of 151107022392 in words is "one hundred fifty-one billion, one hundred seven million, twenty-two thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •