Base | Representation |
---|---|
bin | 1011010100110010… |
… | …1011101111111101 |
3 | 21211212022001102102 |
4 | 2311030223233331 |
5 | 22211220013041 |
6 | 1221353434445 |
7 | 135222403511 |
oct | 26514535775 |
9 | 7755261372 |
10 | 3040001021 |
11 | 1320001842 |
12 | 70a10ba25 |
13 | 395a7b695 |
14 | 20ba5a141 |
15 | 12bd4609b |
hex | b532bbfd |
3040001021 has 2 divisors, whose sum is σ = 3040001022. Its totient is φ = 3040001020.
The previous prime is 3040000967. The next prime is 3040001023. The reversal of 3040001021 is 1201000403.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2042136100 + 997864921 = 45190^2 + 31589^2 .
It is a cyclic number.
It is not a de Polignac number, because 3040001021 - 214 = 3039984637 is a prime.
Together with 3040001023, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 3040000993 and 3040001011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3040001023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1520000510 + 1520000511.
It is an arithmetic number, because the mean of its divisors is an integer number (1520000511).
Almost surely, 23040001021 is an apocalyptic number.
It is an amenable number.
3040001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3040001021 is an equidigital number, since it uses as much as digits as its factorization.
3040001021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 3040001021 is about 55136.2042672508. The cubic root of 3040001021 is about 1448.6314508651.
Adding to 3040001021 its reverse (1201000403), we get a palindrome (4241001424).
The spelling of 3040001021 in words is "three billion, forty million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •