Base | Representation |
---|---|
bin | 10110100100010100… |
… | …01011011101001011 |
3 | 1011021101001100012200 |
4 | 23102022023131023 |
5 | 144303122141230 |
6 | 5322124011243 |
7 | 606145520316 |
oct | 132212133513 |
9 | 34241040180 |
10 | 12115818315 |
11 | 5158077697 |
12 | 2421690b23 |
13 | 11b1156283 |
14 | 82d16997d |
15 | 4ad9ec160 |
hex | 2d228b74b |
12115818315 has 24 divisors (see below), whose sum is σ = 22236091488. Its totient is φ = 6081665280.
The previous prime is 12115818301. The next prime is 12115818317. The reversal of 12115818315 is 51381851121.
12115818315 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12115818315 - 26 = 12115818251 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12115818315.
It is not an unprimeable number, because it can be changed into a prime (12115818317) 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 23 ways as a sum of consecutive naturals, for example, 7918071 + ... + 7919600.
It is an arithmetic number, because the mean of its divisors is an integer number (926503812).
Almost surely, 212115818315 is an apocalyptic number.
12115818315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12115818315 is a deficient number, since it is larger than the sum of its proper divisors (10120273173).
12115818315 is a wasteful number, since it uses less digits than its factorization.
12115818315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15837699 (or 15837696 counting only the distinct ones).
The product of its digits is 9600, while the sum is 36.
The spelling of 12115818315 in words is "twelve billion, one hundred fifteen million, eight hundred eighteen thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •