Base | Representation |
---|---|
bin | 10111101110001101100… |
… | …001110010011110000101 |
3 | 12202211202010220102000202 |
4 | 113232031201302132011 |
5 | 203202040231100432 |
6 | 3244515521220245 |
7 | 225530026204334 |
oct | 27561541623605 |
9 | 5684663812022 |
10 | 1630167050117 |
11 | 57939388a771 |
12 | 223b2b791685 |
13 | ba954aa9858 |
14 | 58c86dbbd1b |
15 | 2c60ec09462 |
hex | 17b8d872785 |
1630167050117 has 2 divisors, whose sum is σ = 1630167050118. Its totient is φ = 1630167050116.
The previous prime is 1630167050081. The next prime is 1630167050137. The reversal of 1630167050117 is 7110507610361.
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., 1603480233796 + 26686816321 = 1266286^2 + 163361^2 .
It is an emirp because it is prime and its reverse (7110507610361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1630167050117 - 234 = 1612987180933 is a prime.
It is a super-2 number, since 2×16301670501172 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1630167050137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 815083525058 + 815083525059.
It is an arithmetic number, because the mean of its divisors is an integer number (815083525059).
Almost surely, 21630167050117 is an apocalyptic number.
It is an amenable number.
1630167050117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1630167050117 is an equidigital number, since it uses as much as digits as its factorization.
1630167050117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26460, while the sum is 38.
The spelling of 1630167050117 in words is "one trillion, six hundred thirty billion, one hundred sixty-seven million, fifty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •