Base | Representation |
---|---|
bin | 1000110010100010101… |
… | …0001110111010000011 |
3 | 112102202212110101011100 |
4 | 2030220222032322003 |
5 | 4433230014440412 |
6 | 153212102545443 |
7 | 13624032643623 |
oct | 2145052167203 |
9 | 472685411140 |
10 | 151006015107 |
11 | 5904aa601a2 |
12 | 25323738283 |
13 | 11316b1447c |
14 | 7447226883 |
15 | 3ddc09cedc |
hex | 2328a8ee83 |
151006015107 has 72 divisors (see below), whose sum is σ = 237049819136. Its totient is φ = 92586219264.
The previous prime is 151006015103. The next prime is 151006015123. The reversal of 151006015107 is 701510600151.
It is a happy number.
151006015107 is a `hidden beast` number, since 1 + 5 + 1 + 0 + 0 + 601 + 51 + 0 + 7 = 666.
It is not a de Polignac number, because 151006015107 - 22 = 151006015103 is a prime.
It is not an unprimeable number, because it can be changed into a prime (151006015103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 22128498 + ... + 22135320.
Almost surely, 2151006015107 is an apocalyptic number.
151006015107 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
151006015107 is a deficient number, since it is larger than the sum of its proper divisors (86043804029).
151006015107 is a wasteful number, since it uses less digits than its factorization.
151006015107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7057 (or 7037 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 27.
Adding to 151006015107 its reverse (701510600151), we get a palindrome (852516615258).
The spelling of 151006015107 in words is "one hundred fifty-one billion, six million, fifteen thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •