Base | Representation |
---|---|
bin | 101111001000010110… |
… | …1110000000110101001 |
3 | 100200020122112110202021 |
4 | 1132100231300012221 |
5 | 3124240303113200 |
6 | 114255103504441 |
7 | 10212063111625 |
oct | 1362055600651 |
9 | 320218473667 |
10 | 101212160425 |
11 | 39a18698182 |
12 | 177478b8121 |
13 | 970c9a0c2c |
14 | 4c82038185 |
15 | 297587841a |
hex | 1790b701a9 |
101212160425 has 12 divisors (see below), whose sum is σ = 125521966080. Its totient is φ = 80957543120.
The previous prime is 101212160419. The next prime is 101212160429. The reversal of 101212160425 is 524061212101.
It is not a de Polignac number, because 101212160425 - 25 = 101212160393 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 101212160425.
It is not an unprimeable number, because it can be changed into a prime (101212160429) 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 11 ways as a sum of consecutive naturals, for example, 133297 + ... + 469246.
It is an arithmetic number, because the mean of its divisors is an integer number (10460163840).
Almost surely, 2101212160425 is an apocalyptic number.
It is an amenable number.
101212160425 is a deficient number, since it is larger than the sum of its proper divisors (24309805655).
101212160425 is an equidigital number, since it uses as much as digits as its factorization.
101212160425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 609272 (or 609267 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 101212160425 its reverse (524061212101), we get a palindrome (625273372526).
The spelling of 101212160425 in words is "one hundred one billion, two hundred twelve million, one hundred sixty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •