Base | Representation |
---|---|
bin | 1000100100100111… |
… | …0001101010010100 |
3 | 12221100211000020212 |
4 | 2021021301222110 |
5 | 14203031310200 |
6 | 1020155144552 |
7 | 111010346135 |
oct | 21111615224 |
9 | 5840730225 |
10 | 2301041300 |
11 | a80972428 |
12 | 542745158 |
13 | 2a894b0cc |
14 | 17b85dc8c |
15 | d702a035 |
hex | 89271a94 |
2301041300 has 72 divisors (see below), whose sum is σ = 5154565920. Its totient is φ = 891158400.
The previous prime is 2301041231. The next prime is 2301041311. The reversal of 2301041300 is 31401032.
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 23 ways as a sum of consecutive naturals, for example, 392390 + ... + 398210.
Almost surely, 22301041300 is an apocalyptic number.
2301041300 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 2301041300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2577282960).
2301041300 is an abundant number, since it is smaller than the sum of its proper divisors (2853524620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2301041300 is a wasteful number, since it uses less digits than its factorization.
2301041300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5961 (or 5954 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2301041300 is about 47969.1703076049. The cubic root of 2301041300 is about 1320.2052978819.
Adding to 2301041300 its reverse (31401032), we get a palindrome (2332442332).
The spelling of 2301041300 in words is "two billion, three hundred one million, forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •