Base | Representation |
---|---|
bin | 100100100101010101101… |
… | …100010111111111110100 |
3 | 22220100001112102021110020 |
4 | 210211111230113333310 |
5 | 312142124323023043 |
6 | 5202525050525140 |
7 | 346426050466503 |
oct | 44452554277764 |
9 | 8810045367406 |
10 | 2513993564148 |
11 | 88a1a6911130 |
12 | 34728b4367b0 |
13 | 1530b7879801 |
14 | 8996c39283a |
15 | 455dc3c1e83 |
hex | 24955b17ff4 |
2513993564148 has 48 divisors (see below), whose sum is σ = 6572209232064. Its totient is φ = 741226602240.
The previous prime is 2513993564141. The next prime is 2513993564153. The reversal of 2513993564148 is 8414653993152.
It is a happy number.
It is a hoax number, since the sum of its digits (60) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 2513993564091 and 2513993564100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2513993564141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 257365465 + ... + 257375232.
It is an arithmetic number, because the mean of its divisors is an integer number (136921025668).
Almost surely, 22513993564148 is an apocalyptic number.
It is an amenable number.
2513993564148 is an abundant number, since it is smaller than the sum of its proper divisors (4058215667916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2513993564148 is a wasteful number, since it uses less digits than its factorization.
2513993564148 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 514740752 (or 514740750 counting only the distinct ones).
The product of its digits is 27993600, while the sum is 60.
The spelling of 2513993564148 in words is "two trillion, five hundred thirteen billion, nine hundred ninety-three million, five hundred sixty-four thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •