Base | Representation |
---|---|
bin | 100100011110010001100… |
… | …100101100111000010000 |
3 | 22212121110220022102211101 |
4 | 210132101210230320100 |
5 | 312031111003012041 |
6 | 5155232243154144 |
7 | 346040063420554 |
oct | 44362144547020 |
9 | 8777426272741 |
10 | 2506408250896 |
11 | 886a64130000 |
12 | 345913075954 |
13 | 15247921ab84 |
14 | 8944cbd3864 |
15 | 452e64dbb31 |
hex | 2479192ce10 |
2506408250896 has 75 divisors (see below), whose sum is σ = 5343382978815. Its totient is φ = 1138928181600.
The previous prime is 2506408250867. The next prime is 2506408250897. The reversal of 2506408250896 is 6980528046052.
The square root of 2506408250896 is 1583164.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2506408250897) 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 14 ways as a sum of consecutive naturals, for example, 766249741 + ... + 766253011.
Almost surely, 22506408250896 is an apocalyptic number.
2506408250896 is the 1583164-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2506408250896
2506408250896 is an abundant number, since it is smaller than the sum of its proper divisors (2836974727919).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2506408250896 is an frugal number, since it uses more digits than its factorization.
2506408250896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6594 (or 3284 counting only the distinct ones).
The product of its (nonzero) digits is 8294400, while the sum is 55.
The spelling of 2506408250896 in words is "two trillion, five hundred six billion, four hundred eight million, two hundred fifty thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •