Base | Representation |
---|---|
bin | 1011001101101001… |
… | …0010101001110101 |
3 | 21202202212112201002 |
4 | 2303122102221311 |
5 | 22131030420223 |
6 | 1214403013045 |
7 | 134406460322 |
oct | 26332225165 |
9 | 7682775632 |
10 | 3010013813 |
11 | 130508aa24 |
12 | 70006a185 |
13 | 38c7ac481 |
14 | 207a91b49 |
15 | 1293c0e28 |
hex | b3692a75 |
3010013813 has 2 divisors, whose sum is σ = 3010013814. Its totient is φ = 3010013812.
The previous prime is 3010013777. The next prime is 3010013819. The reversal of 3010013813 is 3183100103.
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., 2802855364 + 207158449 = 52942^2 + 14393^2 .
It is a cyclic number.
It is not a de Polignac number, because 3010013813 - 214 = 3009997429 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3010013819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1505006906 + 1505006907.
It is an arithmetic number, because the mean of its divisors is an integer number (1505006907).
Almost surely, 23010013813 is an apocalyptic number.
It is an amenable number.
3010013813 is a deficient number, since it is larger than the sum of its proper divisors (1).
3010013813 is an equidigital number, since it uses as much as digits as its factorization.
3010013813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
The square root of 3010013813 is about 54863.5927824637. The cubic root of 3010013813 is about 1443.8525011888.
Adding to 3010013813 its reverse (3183100103), we get a palindrome (6193113916).
The spelling of 3010013813 in words is "three billion, ten million, thirteen thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •