Base | Representation |
---|---|
bin | 1001010101010100… |
… | …0010100010011001 |
3 | 20110121012110202220 |
4 | 2111111002202121 |
5 | 20112330224401 |
6 | 1052333414253 |
7 | 116040605460 |
oct | 22525024231 |
9 | 6417173686 |
10 | 2505320601 |
11 | 10762084a3 |
12 | 59b03a389 |
13 | 30c073134 |
14 | 19aa379d7 |
15 | e9e2c336 |
hex | 95542899 |
2505320601 has 32 divisors (see below), whose sum is σ = 4069478400. Its totient is φ = 1339079040.
The previous prime is 2505320593. The next prime is 2505320633. The reversal of 2505320601 is 1060235052.
It is not a de Polignac number, because 2505320601 - 23 = 2505320593 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2505320641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8220 + ... + 71261.
It is an arithmetic number, because the mean of its divisors is an integer number (127171200).
Almost surely, 22505320601 is an apocalyptic number.
2505320601 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2505320601 is a deficient number, since it is larger than the sum of its proper divisors (1564157799).
2505320601 is a wasteful number, since it uses less digits than its factorization.
2505320601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79589.
The product of its (nonzero) digits is 1800, while the sum is 24.
The square root of 2505320601 is about 50053.1777312889. The cubic root of 2505320601 is about 1358.1709482706.
Adding to 2505320601 its reverse (1060235052), we get a palindrome (3565555653).
It can be divided in two parts, 25053 and 20601, that added together give a palindrome (45654).
The spelling of 2505320601 in words is "two billion, five hundred five million, three hundred twenty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •