Base | Representation |
---|---|
bin | 100100100100101101111… |
… | …101000111101010000000 |
3 | 22220021100001220110012002 |
4 | 210210231331013222000 |
5 | 312134243134140044 |
6 | 5202334553123132 |
7 | 346403403602333 |
oct | 44445575075200 |
9 | 8807301813162 |
10 | 2513326865024 |
11 | 889994547218 |
12 | 3471240b94a8 |
13 | 15300c6c99a1 |
14 | 89907a0661a |
15 | 4559dacb74e |
hex | 2492df47a80 |
2513326865024 has 32 divisors (see below), whose sum is σ = 5224714820640. Its totient is φ = 1202025890560.
The previous prime is 2513326865017. The next prime is 2513326865029. The reversal of 2513326865024 is 4205686233152.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 2513326865024.
It is not an unprimeable number, because it can be changed into a prime (2513326865029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 426852842 + ... + 426858729.
It is an arithmetic number, because the mean of its divisors is an integer number (163272338145).
Almost surely, 22513326865024 is an apocalyptic number.
It is an amenable number.
2513326865024 is an abundant number, since it is smaller than the sum of its proper divisors (2711387955616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2513326865024 is an equidigital number, since it uses as much as digits as its factorization.
2513326865024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 853711608 (or 853711596 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 47.
The spelling of 2513326865024 in words is "two trillion, five hundred thirteen billion, three hundred twenty-six million, eight hundred sixty-five thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •