Base | Representation |
---|---|
bin | 101100101001010101010… |
… | …111101001100100010101 |
3 | 101212022010220111010201002 |
4 | 230221111113221210111 |
5 | 400231320430143102 |
6 | 10305234305313045 |
7 | 434441602316603 |
oct | 54512527514425 |
9 | 11768126433632 |
10 | 3068038912277 |
11 | a83169a89599 |
12 | 416734035785 |
13 | 1934128a5901 |
14 | a86cb2a2873 |
15 | 54c17acb902 |
hex | 2ca555e9915 |
3068038912277 has 2 divisors, whose sum is σ = 3068038912278. Its totient is φ = 3068038912276.
The previous prime is 3068038912231. The next prime is 3068038912283. The reversal of 3068038912277 is 7722198308603.
3068038912277 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3055385137156 + 12653775121 = 1747966^2 + 112489^2 .
It is an emirp because it is prime and its reverse (7722198308603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3068038912277 - 210 = 3068038911253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3068038912207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1534019456138 + 1534019456139.
It is an arithmetic number, because the mean of its divisors is an integer number (1534019456139).
Almost surely, 23068038912277 is an apocalyptic number.
It is an amenable number.
3068038912277 is a deficient number, since it is larger than the sum of its proper divisors (1).
3068038912277 is an equidigital number, since it uses as much as digits as its factorization.
3068038912277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6096384, while the sum is 56.
The spelling of 3068038912277 in words is "three trillion, sixty-eight billion, thirty-eight million, nine hundred twelve thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •