Base | Representation |
---|---|
bin | 1000110101001010100… |
… | …0001011100010101011 |
3 | 112111120221100121122022 |
4 | 2031102220023202223 |
5 | 4441200242320412 |
6 | 153410014215055 |
7 | 13650342513110 |
oct | 2152250134253 |
9 | 474527317568 |
10 | 151710120107 |
11 | 59381453757 |
12 | 2549b4b448b |
13 | 113c9960150 |
14 | 74b294c907 |
15 | 3e2dcd1a72 |
hex | 2352a0b8ab |
151710120107 has 16 divisors (see below), whose sum is σ = 188063473920. Its totient is φ = 119170814112.
The previous prime is 151710120083. The next prime is 151710120139. The reversal of 151710120107 is 701021017151.
It is not a de Polignac number, because 151710120107 - 220 = 151709071531 is a prime.
It is not an unprimeable number, because it can be changed into a prime (151710120167) 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 15 ways as a sum of consecutive naturals, for example, 5984273 + ... + 6009570.
It is an arithmetic number, because the mean of its divisors is an integer number (11753967120).
Almost surely, 2151710120107 is an apocalyptic number.
151710120107 is a deficient number, since it is larger than the sum of its proper divisors (36353353813).
151710120107 is a wasteful number, since it uses less digits than its factorization.
151710120107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11994002.
The product of its (nonzero) digits is 490, while the sum is 26.
Adding to 151710120107 its reverse (701021017151), we get a palindrome (852731137258).
The spelling of 151710120107 in words is "one hundred fifty-one billion, seven hundred ten million, one hundred twenty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •