Base | Representation |
---|---|
bin | 100110000101101000111100… |
… | …111010111001101001110101 |
3 | 210222010010012102221202222001 |
4 | 212011220330322321221311 |
5 | 133424014303124131203 |
6 | 1352134321530335301 |
7 | 50166303432222532 |
oct | 4605507472715165 |
9 | 728103172852861 |
10 | 167513336552053 |
11 | 49414009468a68 |
12 | 1695525958a531 |
13 | 726159449762b |
14 | 2d5198dcd9d89 |
15 | 145761643591d |
hex | 985a3ceb9a75 |
167513336552053 has 2 divisors, whose sum is σ = 167513336552054. Its totient is φ = 167513336552052.
The previous prime is 167513336552041. The next prime is 167513336552057. The reversal of 167513336552053 is 350255633315761.
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., 166593152967409 + 920183584644 = 12907097^2 + 959262^2 .
It is a cyclic number.
It is not a de Polignac number, because 167513336552053 - 229 = 167512799681141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 167513336551985 and 167513336552003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (167513336552057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 83756668276026 + 83756668276027.
It is an arithmetic number, because the mean of its divisors is an integer number (83756668276027).
Almost surely, 2167513336552053 is an apocalyptic number.
It is an amenable number.
167513336552053 is a deficient number, since it is larger than the sum of its proper divisors (1).
167513336552053 is an equidigital number, since it uses as much as digits as its factorization.
167513336552053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25515000, while the sum is 55.
The spelling of 167513336552053 in words is "one hundred sixty-seven trillion, five hundred thirteen billion, three hundred thirty-six million, five hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •