Base | Representation |
---|---|
bin | 1001010101011001… |
… | …0010111101010001 |
3 | 20110121211012121220 |
4 | 2111112102331101 |
5 | 20112421300001 |
6 | 1052344435253 |
7 | 116043450021 |
oct | 22526227521 |
9 | 6417735556 |
10 | 2505650001 |
11 | 1076412a28 |
12 | 59b178b29 |
13 | 30c15a04a |
14 | 19aac1a81 |
15 | e9e94c36 |
hex | 95592f51 |
2505650001 has 8 divisors (see below), whose sum is σ = 3364902240. Its totient is φ = 1658415552.
The previous prime is 2505649999. The next prime is 2505650039. The reversal of 2505650001 is 1000565052.
2505650001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2505650001 - 21 = 2505649999 is a prime.
It is a super-2 number, since 2×25056500012 = 12556563855022600002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2505650201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3003960 + ... + 3004793.
It is an arithmetic number, because the mean of its divisors is an integer number (420612780).
Almost surely, 22505650001 is an apocalyptic number.
It is an amenable number.
2505650001 is a deficient number, since it is larger than the sum of its proper divisors (859252239).
2505650001 is a wasteful number, since it uses less digits than its factorization.
2505650001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6008895.
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 2505650001 is about 50056.4681235103. The cubic root of 2505650001 is about 1358.2304698483.
It can be divided in two parts, 25056 and 50001, that added together give a palindrome (75057).
The spelling of 2505650001 in words is "two billion, five hundred five million, six hundred fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •