Base | Representation |
---|---|
bin | 1011010000000011… |
… | …0110110010100001 |
3 | 21210110220011022102 |
4 | 2310000312302201 |
5 | 22141122421142 |
6 | 1215403420145 |
7 | 134561424122 |
oct | 26400666241 |
9 | 7713804272 |
10 | 3020123297 |
11 | 130a865374 |
12 | 703524655 |
13 | 39190bb09 |
14 | 209164049 |
15 | 12a21b532 |
hex | b4036ca1 |
3020123297 has 2 divisors, whose sum is σ = 3020123298. Its totient is φ = 3020123296.
The previous prime is 3020123291. The next prime is 3020123341. The reversal of 3020123297 is 7923210203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2645662096 + 374461201 = 51436^2 + 19351^2 .
It is an emirp because it is prime and its reverse (7923210203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3020123297 - 214 = 3020106913 is a prime.
It is a super-2 number, since 2×30201232972 = 18242289458164300418, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3020123291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510061648 + 1510061649.
It is an arithmetic number, because the mean of its divisors is an integer number (1510061649).
Almost surely, 23020123297 is an apocalyptic number.
It is an amenable number.
3020123297 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020123297 is an equidigital number, since it uses as much as digits as its factorization.
3020123297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 29.
The square root of 3020123297 is about 54955.6484540033. The cubic root of 3020123297 is about 1445.4671441352.
The spelling of 3020123297 in words is "three billion, twenty million, one hundred twenty-three thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •