Base | Representation |
---|---|
bin | 100100100000111… |
… | …0110010110000001 |
3 | 10011101110200221021 |
4 | 1021001312112001 |
5 | 10002124042010 |
6 | 321324425441 |
7 | 42235132234 |
oct | 11101662601 |
9 | 3141420837 |
10 | 1225221505 |
11 | 579673062 |
12 | 2a23a8281 |
13 | 166ab5451 |
14 | b8a1741b |
15 | 7286d8da |
hex | 49076581 |
1225221505 has 8 divisors (see below), whose sum is σ = 1471776552. Its totient is φ = 979170048.
The previous prime is 1225221497. The next prime is 1225221533. The reversal of 1225221505 is 5051225221.
It can be written as a sum of positive squares in 4 ways, for example, as 719151489 + 506070016 = 26817^2 + 22496^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1225221505 - 23 = 1225221497 is a prime.
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 1225221505.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120522 + ... + 130291.
It is an arithmetic number, because the mean of its divisors is an integer number (183972069).
Almost surely, 21225221505 is an apocalyptic number.
It is an amenable number.
1225221505 is a deficient number, since it is larger than the sum of its proper divisors (246555047).
1225221505 is an equidigital number, since it uses as much as digits as its factorization.
1225221505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251795.
The product of its (nonzero) digits is 2000, while the sum is 25.
The square root of 1225221505 is about 35003.1642141107. The cubic root of 1225221505 is about 1070.0519685360.
Adding to 1225221505 its reverse (5051225221), we get a palindrome (6276446726).
The spelling of 1225221505 in words is "one billion, two hundred twenty-five million, two hundred twenty-one thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •