Base | Representation |
---|---|
bin | 1000100100100110… |
… | …0111111000111000 |
3 | 12221100201222100100 |
4 | 2021021213320320 |
5 | 14203024020042 |
6 | 1020154235400 |
7 | 111010121343 |
oct | 21111477070 |
9 | 5840658310 |
10 | 2301001272 |
11 | a80945349 |
12 | 542725b60 |
13 | 2a8935b1b |
14 | 17b84d45a |
15 | d701d24c |
hex | 89267e38 |
2301001272 has 96 divisors (see below), whose sum is σ = 6611295600. Its totient is φ = 720479232.
The previous prime is 2301001271. The next prime is 2301001273. The reversal of 2301001272 is 2721001032.
It is an interprime number because it is at equal distance from previous prime (2301001271) and next prime (2301001273).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2301001271) 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, 756138 + ... + 759174.
Almost surely, 22301001272 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 2301001272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3305647800).
2301001272 is an abundant number, since it is smaller than the sum of its proper divisors (4310294328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2301001272 is a wasteful number, since it uses less digits than its factorization.
2301001272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3685 (or 3678 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 2301001272 is about 47968.7530794787. The cubic root of 2301001272 is about 1320.1976425820.
The spelling of 2301001272 in words is "two billion, three hundred one million, one thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •