Base | Representation |
---|---|
bin | 10001010100011010111110… |
… | …011000000101011101000101 |
3 | 100222200210110022010200021122 |
4 | 101110122332120011131011 |
5 | 34440432423331341401 |
6 | 430000025303123325 |
7 | 22021053114262556 |
oct | 2124327630053505 |
9 | 328623408120248 |
10 | 76170144012101 |
11 | 222a76385a8107 |
12 | 866234b143545 |
13 | 3366a76aa4129 |
14 | 14b492449832d |
15 | 8c1560c7421b |
hex | 4546be605745 |
76170144012101 has 2 divisors, whose sum is σ = 76170144012102. Its totient is φ = 76170144012100.
The previous prime is 76170144011959. The next prime is 76170144012103. The reversal of 76170144012101 is 10121044107167.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76133058881476 + 37085130625 = 8725426^2 + 192575^2 .
It is a cyclic number.
It is not a de Polignac number, because 76170144012101 - 230 = 76169070270277 is a prime.
Together with 76170144012103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (76170144012103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 38085072006050 + 38085072006051.
It is an arithmetic number, because the mean of its divisors is an integer number (38085072006051).
Almost surely, 276170144012101 is an apocalyptic number.
It is an amenable number.
76170144012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
76170144012101 is an equidigital number, since it uses as much as digits as its factorization.
76170144012101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9408, while the sum is 35.
Adding to 76170144012101 its reverse (10121044107167), we get a palindrome (86291188119268).
The spelling of 76170144012101 in words is "seventy-six trillion, one hundred seventy billion, one hundred forty-four million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •