Base | Representation |
---|---|
bin | 100001011110000011011… |
… | …101110000101001101000 |
3 | 22010212201212110110002222 |
4 | 201132003131300221220 |
5 | 300140411324320404 |
6 | 4520340023213212 |
7 | 325112316643430 |
oct | 41360335605150 |
9 | 8125655413088 |
10 | 2300013120104 |
11 | 807480499447 |
12 | 3119118a7208 |
13 | 138b76007a4b |
14 | 7d46d6492c0 |
15 | 3ec668cddbe |
hex | 21783770a68 |
2300013120104 has 64 divisors (see below), whose sum is σ = 4974305731200. Its totient is φ = 976586010624.
The previous prime is 2300013120059. The next prime is 2300013120113. The reversal of 2300013120104 is 4010213100032.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15219587 + ... + 15369965.
It is an arithmetic number, because the mean of its divisors is an integer number (77723527050).
Almost surely, 22300013120104 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 2300013120104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2487152865600).
2300013120104 is an abundant number, since it is smaller than the sum of its proper divisors (2674292611096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2300013120104 is a wasteful number, since it uses less digits than its factorization.
2300013120104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152922 (or 152918 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2300013120104 its reverse (4010213100032), we get a palindrome (6310226220136).
The spelling of 2300013120104 in words is "two trillion, three hundred billion, thirteen million, one hundred twenty thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •