Base | Representation |
---|---|
bin | 1000100100101000… |
… | …0110100110100000 |
3 | 12221100222100220121 |
4 | 2021022012212200 |
5 | 14203042031242 |
6 | 1020201050024 |
7 | 111011154166 |
oct | 21112064640 |
9 | 5840870817 |
10 | 2301127072 |
11 | a80a20912 |
12 | 542786914 |
13 | 2a897b16a |
14 | 17b883236 |
15 | d7045667 |
hex | 892869a0 |
2301127072 has 48 divisors (see below), whose sum is σ = 4826449152. Its totient is φ = 1076198400.
The previous prime is 2301127063. The next prime is 2301127079. The reversal of 2301127072 is 2707211032.
It is not an unprimeable number, because it can be changed into a prime (2301127079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75697 + ... + 101647.
It is an arithmetic number, because the mean of its divisors is an integer number (100551024).
Almost surely, 22301127072 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 2301127072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2413224576).
2301127072 is an abundant number, since it is smaller than the sum of its proper divisors (2525322080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2301127072 is a wasteful number, since it uses less digits than its factorization.
2301127072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26141 (or 26133 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 25.
The square root of 2301127072 is about 47970.0643318310. The cubic root of 2301127072 is about 1320.2217013600.
The spelling of 2301127072 in words is "two billion, three hundred one million, one hundred twenty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •