Base | Representation |
---|---|
bin | 10010000100111001100… |
… | …011000100000000101101 |
3 | 11101202100211020011222101 |
4 | 102010321203010000231 |
5 | 130323022011310300 |
6 | 2350355221415101 |
7 | 155514101430322 |
oct | 22047143040055 |
9 | 4352324204871 |
10 | 1242211041325 |
11 | 439900826211 |
12 | 1808b9b6a491 |
13 | 901a8766437 |
14 | 441a2608b49 |
15 | 224a5870b6a |
hex | 121398c402d |
1242211041325 has 24 divisors (see below), whose sum is σ = 1631544849000. Its totient is φ = 934970726400.
The previous prime is 1242211041317. The next prime is 1242211041341. The reversal of 1242211041325 is 5231401122421.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 225909139401 + 1016301901924 = 475299^2 + 1008118^2 .
It is not a de Polignac number, because 1242211041325 - 23 = 1242211041317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1242211041293 and 1242211041302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 636705 + ... + 1699945.
It is an arithmetic number, because the mean of its divisors is an integer number (67981035375).
Almost surely, 21242211041325 is an apocalyptic number.
It is an amenable number.
1242211041325 is a deficient number, since it is larger than the sum of its proper divisors (389333807675).
1242211041325 is a wasteful number, since it uses less digits than its factorization.
1242211041325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1066017 (or 1066012 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 1242211041325 its reverse (5231401122421), we get a palindrome (6473612163746).
The spelling of 1242211041325 in words is "one trillion, two hundred forty-two billion, two hundred eleven million, forty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •