Base | Representation |
---|---|
bin | 1000100100010111… |
… | …0110000111111001 |
3 | 12221021212122221122 |
4 | 2021011312013321 |
5 | 14202300323001 |
6 | 1020121115025 |
7 | 110665525301 |
oct | 21105660771 |
9 | 5837778848 |
10 | 2300011001 |
11 | a80329342 |
12 | 542328a75 |
13 | 2a867a172 |
14 | 17b672601 |
15 | d6dc4b1b |
hex | 891761f9 |
2300011001 has 2 divisors, whose sum is σ = 2300011002. Its totient is φ = 2300011000.
The previous prime is 2300010997. The next prime is 2300011013. The reversal of 2300011001 is 1001100032.
2300011001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1560171001 + 739840000 = 39499^2 + 27200^2 .
It is a cyclic number.
It is not a de Polignac number, because 2300011001 - 22 = 2300010997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2300011001.
It is not a weakly prime, because it can be changed into another prime (2300011061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150005500 + 1150005501.
It is an arithmetic number, because the mean of its divisors is an integer number (1150005501).
Almost surely, 22300011001 is an apocalyptic number.
It is an amenable number.
2300011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
2300011001 is an equidigital number, since it uses as much as digits as its factorization.
2300011001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 2300011001 is about 47958.4299263435. The cubic root of 2300011001 is about 1320.0082263414.
Adding to 2300011001 its reverse (1001100032), we get a palindrome (3301111033).
The spelling of 2300011001 in words is "two billion, three hundred million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •