Base | Representation |
---|---|
bin | 100100011011010101000… |
… | …010000100001001010000 |
3 | 22212022022110012102011221 |
4 | 210123111002010021100 |
5 | 312003121213221134 |
6 | 5153550325014424 |
7 | 345565513614013 |
oct | 44332502041120 |
9 | 8768273172157 |
10 | 2503245054544 |
11 | 885690634843 |
12 | 34518b854414 |
13 | 152093a97060 |
14 | 8922ca6937a |
15 | 451ad95d5b4 |
hex | 246d5084250 |
2503245054544 has 80 divisors (see below), whose sum is σ = 5269054040208. Its totient is φ = 1145207771136.
The previous prime is 2503245054521. The next prime is 2503245054551. The reversal of 2503245054544 is 4454505423052.
It can be written as a sum of positive squares in 8 ways, for example, as 8386896400 + 2494858158144 = 91580^2 + 1579512^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 2503245054544.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19226914 + ... + 19356670.
Almost surely, 22503245054544 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2503245054544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2634527020104).
2503245054544 is an abundant number, since it is smaller than the sum of its proper divisors (2765808985664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2503245054544 is a wasteful number, since it uses less digits than its factorization.
2503245054544 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130592 (or 130586 counting only the distinct ones).
The product of its (nonzero) digits is 1920000, while the sum is 43.
The spelling of 2503245054544 in words is "two trillion, five hundred three billion, two hundred forty-five million, fifty-four thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •