Base | Representation |
---|---|
bin | 100000110110101… |
… | …1010100010100001 |
3 | 2211211101221201212 |
4 | 1001231122202201 |
5 | 4224210033400 |
6 | 301220435505 |
7 | 36214310540 |
oct | 10155324241 |
9 | 2754357655 |
10 | 1102424225 |
11 | 516320701 |
12 | 269248b95 |
13 | 14751c236 |
14 | a65b0157 |
15 | 66bb4335 |
hex | 41b5a8a1 |
1102424225 has 12 divisors (see below), whose sum is σ = 1562292864. Its totient is φ = 755947920.
The previous prime is 1102424161. The next prime is 1102424227. The reversal of 1102424225 is 5224242011.
It is not a de Polignac number, because 1102424225 - 26 = 1102424161 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 1102424225.
It is not an unprimeable number, because it can be changed into a prime (1102424227) by changing a digit.
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, 3149609 + ... + 3149958.
It is an arithmetic number, because the mean of its divisors is an integer number (130191072).
Almost surely, 21102424225 is an apocalyptic number.
It is an amenable number.
1102424225 is a deficient number, since it is larger than the sum of its proper divisors (459868639).
1102424225 is an equidigital number, since it uses as much as digits as its factorization.
1102424225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6299584 (or 6299579 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 23.
The square root of 1102424225 is about 33202.7743569720. The cubic root of 1102424225 is about 1033.0378861094.
Adding to 1102424225 its reverse (5224242011), we get a palindrome (6326666236).
The spelling of 1102424225 in words is "one billion, one hundred two million, four hundred twenty-four thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •