Base | Representation |
---|---|
bin | 101101010000011011101… |
… | …100101001001010011001 |
3 | 102000022111201012200020001 |
4 | 231100123230221022121 |
5 | 401423310334310243 |
6 | 10340420211333001 |
7 | 440456135261305 |
oct | 55203354511231 |
9 | 12008451180201 |
10 | 3110021010073 |
11 | a99a52866a8a |
12 | 4228ab8b1161 |
13 | 1973734a4bb3 |
14 | aa750bc8d05 |
15 | 55d735dba4d |
hex | 2d41bb29299 |
3110021010073 has 2 divisors, whose sum is σ = 3110021010074. Its totient is φ = 3110021010072.
The previous prime is 3110021010071. The next prime is 3110021010091. The reversal of 3110021010073 is 3700101200113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2433263051664 + 676757958409 = 1559892^2 + 822653^2 .
It is a cyclic number.
It is not a de Polignac number, because 3110021010073 - 21 = 3110021010071 is a prime.
Together with 3110021010071, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 3110021010073.
It is not a weakly prime, because it can be changed into another prime (3110021010071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1555010505036 + 1555010505037.
It is an arithmetic number, because the mean of its divisors is an integer number (1555010505037).
Almost surely, 23110021010073 is an apocalyptic number.
It is an amenable number.
3110021010073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3110021010073 is an equidigital number, since it uses as much as digits as its factorization.
3110021010073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 126, while the sum is 19.
Adding to 3110021010073 its reverse (3700101200113), we get a palindrome (6810122210186).
The spelling of 3110021010073 in words is "three trillion, one hundred ten billion, twenty-one million, ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •