Base | Representation |
---|---|
bin | 100001101100001001111… |
… | …111100010110001101000 |
3 | 22012022211010121220201102 |
4 | 201230021333202301220 |
5 | 300412414141300000 |
6 | 4531322330540532 |
7 | 326156462005646 |
oct | 41541177426150 |
9 | 8168733556642 |
10 | 2315155025000 |
11 | 812940723734 |
12 | 314838897748 |
13 | 13a41a07a19c |
14 | 800a864c196 |
15 | 40350dc43d5 |
hex | 21b09fe2c68 |
2315155025000 has 96 divisors (see below), whose sum is σ = 5430530861280. Its totient is φ = 925254120000.
The previous prime is 2315155024957. The next prime is 2315155025003. The reversal of 2315155025000 is 5205515132.
It is not an unprimeable number, because it can be changed into a prime (2315155025003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29035187 + ... + 29114813.
It is an arithmetic number, because the mean of its divisors is an integer number (56568029805).
Almost surely, 22315155025000 is an apocalyptic number.
2315155025000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2315155025000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2715265430640).
2315155025000 is an abundant number, since it is smaller than the sum of its proper divisors (3115375836280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2315155025000 is an equidigital number, since it uses as much as digits as its factorization.
2315155025000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80821 (or 80797 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 29.
The spelling of 2315155025000 in words is "two trillion, three hundred fifteen billion, one hundred fifty-five million, twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •