Base | Representation |
---|---|
bin | 10110100100001111… |
… | …11101000101001111 |
3 | 1011021022221201021000 |
4 | 23102013331011033 |
5 | 144303000011101 |
6 | 5322103311343 |
7 | 606140541165 |
oct | 132207750517 |
9 | 34238851230 |
10 | 12115235151 |
11 | 5157809538 |
12 | 242144b553 |
13 | 11b0cb09c6 |
14 | 82d057235 |
15 | 4ad934486 |
hex | 2d21fd14f |
12115235151 has 16 divisors (see below), whose sum is σ = 17952659200. Its totient is φ = 8074950264.
The previous prime is 12115235137. The next prime is 12115235159. The reversal of 12115235151 is 15153251121.
It is a happy number.
12115235151 is a `hidden beast` number, since 1 + 211 + 52 + 351 + 51 = 666.
It is not a de Polignac number, because 12115235151 - 231 = 9967751503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12115235159) 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, 71910 + ... + 171468.
It is an arithmetic number, because the mean of its divisors is an integer number (1122041200).
Almost surely, 212115235151 is an apocalyptic number.
12115235151 is a deficient number, since it is larger than the sum of its proper divisors (5837424049).
12115235151 is an equidigital number, since it uses as much as digits as its factorization.
12115235151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104075 (or 104069 counting only the distinct ones).
The product of its digits is 1500, while the sum is 27.
Adding to 12115235151 its reverse (15153251121), we get a palindrome (27268486272).
The spelling of 12115235151 in words is "twelve billion, one hundred fifteen million, two hundred thirty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •