Base | Representation |
---|---|
bin | 1000100100101011… |
… | …1011100111001001 |
3 | 12221101101101202102 |
4 | 2021022323213021 |
5 | 14203121003301 |
6 | 1020205443145 |
7 | 111013050212 |
oct | 21112734711 |
9 | 5841341672 |
10 | 2301344201 |
11 | a81059a62 |
12 | 5428704b5 |
13 | 2a8a25c40 |
14 | 17b8dc409 |
15 | d7089b6b |
hex | 892bb9c9 |
2301344201 has 16 divisors (see below), whose sum is σ = 2612211840. Its totient is φ = 2009888640.
The previous prime is 2301344191. The next prime is 2301344209. The reversal of 2301344201 is 1024431032.
2301344201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2301344201 - 26 = 2301344137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2301344209) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 197621 + ... + 208941.
It is an arithmetic number, because the mean of its divisors is an integer number (163263240).
Almost surely, 22301344201 is an apocalyptic number.
It is an amenable number.
2301344201 is a deficient number, since it is larger than the sum of its proper divisors (310867639).
2301344201 is a wasteful number, since it uses less digits than its factorization.
2301344201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12176.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2301344201 is about 47972.3274503124. The cubic root of 2301344201 is about 1320.2632244041.
Adding to 2301344201 its reverse (1024431032), we get a palindrome (3325775233).
It can be divided in two parts, 230 and 1344201, that added together give a palindrome (1344431).
The spelling of 2301344201 in words is "two billion, three hundred one million, three hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •