Base | Representation |
---|---|
bin | 1001101100111000… |
… | …0000011110111011 |
3 | 20201111011001011020 |
4 | 2123032000132323 |
5 | 20313124443400 |
6 | 1110223433523 |
7 | 121350554166 |
oct | 23316003673 |
9 | 6644131136 |
10 | 2604140475 |
11 | 1116a73312 |
12 | 6081558a3 |
13 | 326692731 |
14 | 1a9bdcadd |
15 | 10394c2a0 |
hex | 9b3807bb |
2604140475 has 48 divisors (see below), whose sum is σ = 4654702080. Its totient is φ = 1280188800.
The previous prime is 2604140459. The next prime is 2604140479. The reversal of 2604140475 is 5740414062.
Together with 2050561604 it forms a betrothed pair.
It is not a de Polignac number, because 2604140475 - 24 = 2604140459 is a prime.
It is a super-2 number, since 2×26041404752 = 13563095227066451250, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2604140479) 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 47 ways as a sum of consecutive naturals, for example, 28030 + ... + 77420.
It is an arithmetic number, because the mean of its divisors is an integer number (96972960).
Almost surely, 22604140475 is an apocalyptic number.
2604140475 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2604140475 is a deficient number, since it is larger than the sum of its proper divisors (2050561605).
2604140475 is a wasteful number, since it uses less digits than its factorization.
2604140475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49460 (or 49455 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 33.
The square root of 2604140475 is about 51030.7796824622. The cubic root of 2604140475 is about 1375.7984079318.
The spelling of 2604140475 in words is "two billion, six hundred four million, one hundred forty thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •