Base | Representation |
---|---|
bin | 10110100010011110… |
… | …00010110100001001 |
3 | 1011020021212202121121 |
4 | 23101033002310021 |
5 | 144240140111200 |
6 | 5320411435241 |
7 | 605566664311 |
oct | 132117026411 |
9 | 34207782547 |
10 | 12100316425 |
11 | 514a34990a |
12 | 2418455b21 |
13 | 11aab89362 |
14 | 82b092441 |
15 | 4ac488e1a |
hex | 2d13c2d09 |
12100316425 has 6 divisors (see below), whose sum is σ = 15004392398. Its totient is φ = 9680253120.
The previous prime is 12100316411. The next prime is 12100316467. The reversal of 12100316425 is 52461300121.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 2591726281 + 9508590144 = 50909^2 + 97512^2 .
It is a de Polignac number, because none of the positive numbers 2k-12100316425 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25), and also a Moran number because the ratio is a prime number: 484012657 = 12100316425 / (1 + 2 + 1 + 0 + 0 + 3 + 1 + 6 + 4 + 2 + 5).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12100316425.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 242006304 + ... + 242006353.
Almost surely, 212100316425 is an apocalyptic number.
It is an amenable number.
12100316425 is a deficient number, since it is larger than the sum of its proper divisors (2904075973).
12100316425 is an equidigital number, since it uses as much as digits as its factorization.
12100316425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484012667 (or 484012662 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 12100316425 its reverse (52461300121), we get a palindrome (64561616546).
The spelling of 12100316425 in words is "twelve billion, one hundred million, three hundred sixteen thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •