Base | Representation |
---|---|
bin | 110101100011011100… |
… | …1101001100111101111 |
3 | 101222211222100210201200 |
4 | 1223012321221213233 |
5 | 3341013033314101 |
6 | 124455540540543 |
7 | 11210650104213 |
oct | 1530671514757 |
9 | 358758323650 |
10 | 115006151151 |
11 | 44856a79611 |
12 | 1a3573b1753 |
13 | aaca700518 |
14 | 57d0006943 |
15 | 2ed1866986 |
hex | 1ac6e699ef |
115006151151 has 12 divisors (see below), whose sum is σ = 166171676112. Its totient is φ = 76646915136.
The previous prime is 115006151147. The next prime is 115006151153. The reversal of 115006151151 is 151151600511.
115006151151 is a `hidden beast` number, since 1 + 1 + 500 + 6 + 1 + 5 + 1 + 151 = 666.
It is not a de Polignac number, because 115006151151 - 22 = 115006151147 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115006151153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1957131 + ... + 2015036.
It is an arithmetic number, because the mean of its divisors is an integer number (13847639676).
Almost surely, 2115006151151 is an apocalyptic number.
115006151151 is a deficient number, since it is larger than the sum of its proper divisors (51165524961).
115006151151 is a wasteful number, since it uses less digits than its factorization.
115006151151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3975390 (or 3975387 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 27.
Adding to 115006151151 its reverse (151151600511), we get a palindrome (266157751662).
The spelling of 115006151151 in words is "one hundred fifteen billion, six million, one hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •