Base | Representation |
---|---|
bin | 1001010101010010… |
… | …1101011001010101 |
3 | 20110121001001222122 |
4 | 2111110231121111 |
5 | 20112314442010 |
6 | 1052331505325 |
7 | 116040065141 |
oct | 22524553125 |
9 | 6417031878 |
10 | 2505234005 |
11 | 107615942a |
12 | 59abb8245 |
13 | 30c0428b1 |
14 | 19aa14221 |
15 | e9e11855 |
hex | 9552d655 |
2505234005 has 4 divisors (see below), whose sum is σ = 3006280812. Its totient is φ = 2004187200.
The previous prime is 2505233993. The next prime is 2505234047. The reversal of 2505234005 is 5004325052.
2505234005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 759498481 + 1745735524 = 27559^2 + 41782^2 .
It is not a de Polignac number, because 2505234005 - 28 = 2505233749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 250523396 + ... + 250523405.
It is an arithmetic number, because the mean of its divisors is an integer number (751570203).
Almost surely, 22505234005 is an apocalyptic number.
It is an amenable number.
2505234005 is a deficient number, since it is larger than the sum of its proper divisors (501046807).
2505234005 is an equidigital number, since it uses as much as digits as its factorization.
2505234005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501046806.
The product of its (nonzero) digits is 6000, while the sum is 26.
The square root of 2505234005 is about 50052.3126838311. The cubic root of 2505234005 is about 1358.1552997708.
Adding to 2505234005 its reverse (5004325052), we get a palindrome (7509559057).
The spelling of 2505234005 in words is "two billion, five hundred five million, two hundred thirty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •