Base | Representation |
---|---|
bin | 1000011000011100… |
… | …0101101011011111 |
3 | 12210210210002220111 |
4 | 2012013011223133 |
5 | 14102000131330 |
6 | 1011133230451 |
7 | 106520504653 |
oct | 20607055337 |
9 | 5723702814 |
10 | 2250005215 |
11 | a55084247 |
12 | 529632427 |
13 | 29b1bc243 |
14 | 174b76a63 |
15 | d27e832a |
hex | 861c5adf |
2250005215 has 4 divisors (see below), whose sum is σ = 2700006264. Its totient is φ = 1800004168.
The previous prime is 2250005209. The next prime is 2250005227. The reversal of 2250005215 is 5125000522.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2250005215 - 23 = 2250005207 is a prime.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 225000517 + ... + 225000526.
It is an arithmetic number, because the mean of its divisors is an integer number (675001566).
Almost surely, 22250005215 is an apocalyptic number.
2250005215 is a deficient number, since it is larger than the sum of its proper divisors (450001049).
2250005215 is an equidigital number, since it uses as much as digits as its factorization.
2250005215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450001048.
The product of its (nonzero) digits is 1000, while the sum is 22.
The square root of 2250005215 is about 47434.2198734205. The cubic root of 2250005215 is about 1310.3717094864.
Adding to 2250005215 its reverse (5125000522), we get a palindrome (7375005737).
The spelling of 2250005215 in words is "two billion, two hundred fifty million, five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •