Base | Representation |
---|---|
bin | 11000001011000111101001… |
… | …001011011100011000101111 |
3 | 111221102211101002022100100011 |
4 | 120023013221023130120233 |
5 | 102413400200304202241 |
6 | 1014041244211514051 |
7 | 31252111154406364 |
oct | 3013075113343057 |
9 | 457384332270304 |
10 | 106317237569071 |
11 | 3096a983a17681 |
12 | bb10bab8b8927 |
13 | 47428985a7249 |
14 | 1c37ad31c446b |
15 | c4584e3b9281 |
hex | 60b1e92dc62f |
106317237569071 has 2 divisors, whose sum is σ = 106317237569072. Its totient is φ = 106317237569070.
The previous prime is 106317237569069. The next prime is 106317237569087. The reversal of 106317237569071 is 170965732713601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 106317237569071 - 21 = 106317237569069 is a prime.
It is a super-2 number, since 2×1063172375690712 (a number of 29 digits) contains 22 as substring.
Together with 106317237569069, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 106317237568997 and 106317237569015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106317237569041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53158618784535 + 53158618784536.
It is an arithmetic number, because the mean of its divisors is an integer number (53158618784536).
Almost surely, 2106317237569071 is an apocalyptic number.
106317237569071 is a deficient number, since it is larger than the sum of its proper divisors (1).
106317237569071 is an equidigital number, since it uses as much as digits as its factorization.
106317237569071 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10001880, while the sum is 58.
The spelling of 106317237569071 in words is "one hundred six trillion, three hundred seventeen billion, two hundred thirty-seven million, five hundred sixty-nine thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •