Base | Representation |
---|---|
bin | 1000010010100111… |
… | …0100011111010111 |
3 | 12202002202221002100 |
4 | 2010221310133113 |
5 | 14024220233130 |
6 | 1004501213143 |
7 | 106102623516 |
oct | 20451643727 |
9 | 5662687070 |
10 | 2225555415 |
11 | a422a47a6 |
12 | 5214011b3 |
13 | 29610b5c5 |
14 | 17181067d |
15 | d05b8c60 |
hex | 84a747d7 |
2225555415 has 48 divisors (see below), whose sum is σ = 3979718496. Its totient is φ = 1149984000.
The previous prime is 2225555377. The next prime is 2225555419. The reversal of 2225555415 is 5145555222.
It is not a de Polignac number, because 2225555415 - 212 = 2225551319 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 2225555415.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2225555419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 177865 + ... + 189965.
It is an arithmetic number, because the mean of its divisors is an integer number (82910802).
Almost surely, 22225555415 is an apocalyptic number.
2225555415 is a deficient number, since it is larger than the sum of its proper divisors (1754163081).
2225555415 is a wasteful number, since it uses less digits than its factorization.
2225555415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12240 (or 12237 counting only the distinct ones).
The product of its digits is 100000, while the sum is 36.
The square root of 2225555415 is about 47175.7926801448. The cubic root of 2225555415 is about 1305.6080048771.
The spelling of 2225555415 in words is "two billion, two hundred twenty-five million, five hundred fifty-five thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •