Base | Representation |
---|---|
bin | 100100011011010010011… |
… | …011111011101011100100 |
3 | 22212022012102020211000210 |
4 | 210123102123323223210 |
5 | 312003024041111342 |
6 | 5153542131335420 |
7 | 345564444500301 |
oct | 44332233735344 |
9 | 8768172224023 |
10 | 2503201503972 |
11 | 885668a99634 |
12 | 345179151570 |
13 | 152087a593a0 |
14 | 89226d700a8 |
15 | 451a9c0979c |
hex | 246d26fbae4 |
2503201503972 has 96 divisors (see below), whose sum is σ = 6506341187584. Its totient is φ = 743838940800.
The previous prime is 2503201503967. The next prime is 2503201503997. The reversal of 2503201503972 is 2793051023052.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 2503201503972.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1823697 + ... + 2886567.
Almost surely, 22503201503972 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 2503201503972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3253170593792).
2503201503972 is an abundant number, since it is smaller than the sum of its proper divisors (4003139683612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2503201503972 is a wasteful number, since it uses less digits than its factorization.
2503201503972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1063409 (or 1063407 counting only the distinct ones).
The product of its (nonzero) digits is 113400, while the sum is 39.
The spelling of 2503201503972 in words is "two trillion, five hundred three billion, two hundred one million, five hundred three thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •