Base | Representation |
---|---|
bin | 1001010101010110… |
… | …1011111001010001 |
3 | 20110121112002010222 |
4 | 2111111223321101 |
5 | 20112401140001 |
6 | 1052341202425 |
7 | 116042212400 |
oct | 22525537121 |
9 | 6417462128 |
10 | 2505490001 |
11 | 10763137a3 |
12 | 59b100415 |
13 | 30c102281 |
14 | 19aa7d637 |
15 | e9e6261b |
hex | 9556be51 |
2505490001 has 6 divisors (see below), whose sum is σ = 2914549650. Its totient is φ = 2147562816.
The previous prime is 2505489979. The next prime is 2505490007. The reversal of 2505490001 is 1000945052.
It can be written as a sum of positive squares in only one way, i.e., 2227934401 + 277555600 = 47201^2 + 16660^2 .
It is not a de Polignac number, because 2505490001 - 210 = 2505488977 is a prime.
It is a super-2 number, since 2×25054900012 = 12554960290221960002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2505490007) 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 5 ways as a sum of consecutive naturals, for example, 25566176 + ... + 25566273.
It is an arithmetic number, because the mean of its divisors is an integer number (485758275).
Almost surely, 22505490001 is an apocalyptic number.
It is an amenable number.
2505490001 is a deficient number, since it is larger than the sum of its proper divisors (409059649).
2505490001 is an equidigital number, since it uses as much as digits as its factorization.
2505490001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51132463 (or 51132456 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
The square root of 2505490001 is about 50054.8699029375. The cubic root of 2505490001 is about 1358.2015589867.
The spelling of 2505490001 in words is "two billion, five hundred five million, four hundred ninety thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •