Base | Representation |
---|---|
bin | 100001100010101101000… |
… | …000010001010101000000 |
3 | 22011100121202120012222120 |
4 | 201202231000101111000 |
5 | 300231122240000000 |
6 | 4522523224404240 |
7 | 325350113141223 |
oct | 41425500212500 |
9 | 8140552505876 |
10 | 2305005000000 |
11 | 80960225a71a |
12 | 312885616680 |
13 | 139490282631 |
14 | 7d7c45d55ba |
15 | 3ee59c7e6a0 |
hex | 218ad011540 |
2305005000000 has 448 divisors, whose sum is σ = 7870804850688. Its totient is φ = 594720000000.
The previous prime is 2305004999971. The next prime is 2305005000013. The reversal of 2305005000000 is 5005032.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 464997522 + ... + 465002478.
Almost surely, 22305005000000 is an apocalyptic number.
2305005000000 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 2305005000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3935402425344).
2305005000000 is an abundant number, since it is smaller than the sum of its proper divisors (5565799850688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2305005000000 is an frugal number, since it uses more digits than its factorization.
2305005000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5038 (or 4998 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 15.
The spelling of 2305005000000 in words is "two trillion, three hundred five billion, five million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •