Base | Representation |
---|---|
bin | 1011001011100111… |
… | …0100101011000001 |
3 | 21202011212010020121 |
4 | 2302321310223001 |
5 | 22121341034101 |
6 | 1213500340241 |
7 | 134244230602 |
oct | 26271645301 |
9 | 7664763217 |
10 | 3001502401 |
11 | 13002a71a7 |
12 | 6b9244681 |
13 | 38aabc331 |
14 | 2068b7da9 |
15 | 12878e0a1 |
hex | b2e74ac1 |
3001502401 has 2 divisors, whose sum is σ = 3001502402. Its totient is φ = 3001502400.
The previous prime is 3001502393. The next prime is 3001502431. The reversal of 3001502401 is 1042051003.
3001502401 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., 1838351376 + 1163151025 = 42876^2 + 34105^2 .
It is a cyclic number.
It is not a de Polignac number, because 3001502401 - 23 = 3001502393 is a prime.
It is a super-3 number, since 3×30015024013 (a number of 29 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (3001502431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1500751200 + 1500751201.
It is an arithmetic number, because the mean of its divisors is an integer number (1500751201).
Almost surely, 23001502401 is an apocalyptic number.
It is an amenable number.
3001502401 is a deficient number, since it is larger than the sum of its proper divisors (1).
3001502401 is an equidigital number, since it uses as much as digits as its factorization.
3001502401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 3001502401 is about 54785.9690157982. The cubic root of 3001502401 is about 1442.4902898163.
Adding to 3001502401 its reverse (1042051003), we get a palindrome (4043553404).
The spelling of 3001502401 in words is "three billion, one million, five hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •