Base | Representation |
---|---|
bin | 101010111111100… |
… | …1000010000000001 |
3 | 10201112112021221102 |
4 | 1111333020100001 |
5 | 10423302042400 |
6 | 355052104145 |
7 | 50515000355 |
oct | 12577102001 |
9 | 3645467842 |
10 | 1442612225 |
11 | 680353a0a |
12 | 343165055 |
13 | 19cb4b302 |
14 | d9845465 |
15 | 869b09d5 |
hex | 55fc8401 |
1442612225 has 12 divisors (see below), whose sum is σ = 1789455036. Its totient is φ = 1153692480.
The previous prime is 1442612201. The next prime is 1442612239. The reversal of 1442612225 is 5222162441.
It can be written as a sum of positive squares in 6 ways, for example, as 70946929 + 1371665296 = 8423^2 + 37036^2 .
It is not a de Polignac number, because 1442612225 - 212 = 1442608129 is a prime.
It is a super-2 number, since 2×14426122252 = 4162260063438901250, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80159 + ... + 96491.
It is an arithmetic number, because the mean of its divisors is an integer number (149121253).
Almost surely, 21442612225 is an apocalyptic number.
It is an amenable number.
1442612225 is a deficient number, since it is larger than the sum of its proper divisors (346842811).
1442612225 is a wasteful number, since it uses less digits than its factorization.
1442612225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19876 (or 19871 counting only the distinct ones).
The product of its digits is 7680, while the sum is 29.
The square root of 1442612225 is about 37981.7354132220. The cubic root of 1442612225 is about 1129.9256549099.
Adding to 1442612225 its reverse (5222162441), we get a palindrome (6664774666).
The spelling of 1442612225 in words is "one billion, four hundred forty-two million, six hundred twelve thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •