Base | Representation |
---|---|
bin | 1001100100100111… |
… | …0000100101010100 |
3 | 20122001220201102020 |
4 | 2121021300211110 |
5 | 20230241103330 |
6 | 1102544413140 |
7 | 120450104001 |
oct | 23111604524 |
9 | 6561821366 |
10 | 2569472340 |
11 | 10a9444666 |
12 | 5b86171b0 |
13 | 31c444a46 |
14 | 1a53768a8 |
15 | 1008a0210 |
hex | 99270954 |
2569472340 has 48 divisors (see below), whose sum is σ = 7201324032. Its totient is φ = 684544896.
The previous prime is 2569472333. The next prime is 2569472341. The reversal of 2569472340 is 432749652.
It is a junction number, because it is equal to n+sod(n) for n = 2569472292 and 2569472301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2569472341) 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 15 ways as a sum of consecutive naturals, for example, 45522 + ... + 84918.
It is an arithmetic number, because the mean of its divisors is an integer number (150027584).
Almost surely, 22569472340 is an apocalyptic number.
2569472340 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2569472340 is an abundant number, since it is smaller than the sum of its proper divisors (4631851692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2569472340 is a wasteful number, since it uses less digits than its factorization.
2569472340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40496 (or 40494 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 42.
The square root of 2569472340 is about 50689.9629118034. The cubic root of 2569472340 is about 1369.6659174375.
The spelling of 2569472340 in words is "two billion, five hundred sixty-nine million, four hundred seventy-two thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •