Base | Representation |
---|---|
bin | 11101110101101000000… |
… | …00000010010001000101 |
3 | 10122000021111022002222111 |
4 | 32322310000002101011 |
5 | 113244123330441423 |
6 | 2102551444101021 |
7 | 134032650163021 |
oct | 16726400022105 |
9 | 3560244262874 |
10 | 1025222124613 |
11 | 365881186485 |
12 | 146840994771 |
13 | 758a783482b |
14 | 3789a0d1381 |
15 | 1ba05bb360d |
hex | eeb4002445 |
1025222124613 has 12 divisors (see below), whose sum is σ = 1051321308588. Its totient is φ = 999755655360.
The previous prime is 1025222124551. The next prime is 1025222124623. The reversal of 1025222124613 is 3164212225201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 229418966529 + 795803158084 = 478977^2 + 892078^2 .
It is a de Polignac number, because none of the positive numbers 2k-1025222124613 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1025222124623) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 691503 + ... + 1590163.
It is an arithmetic number, because the mean of its divisors is an integer number (87610109049).
Almost surely, 21025222124613 is an apocalyptic number.
It is an amenable number.
1025222124613 is a deficient number, since it is larger than the sum of its proper divisors (26099183975).
1025222124613 is an frugal number, since it uses more digits than its factorization.
1025222124613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 899364 (or 899321 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 1025222124613 its reverse (3164212225201), we get a palindrome (4189434349814).
The spelling of 1025222124613 in words is "one trillion, twenty-five billion, two hundred twenty-two million, one hundred twenty-four thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •