Base | Representation |
---|---|
bin | 1101110010010011111001001… |
… | …0001101011001010111001111 |
3 | 11201012212201002100102201100021 |
4 | 3130210332102031121113033 |
5 | 2004123244322320200421 |
6 | 13315130502425243011 |
7 | 411224131133345416 |
oct | 33444762215312717 |
9 | 4635781070381307 |
10 | 970111011100111 |
11 | 26111a85102a121 |
12 | 9097a01a933467 |
13 | 328400ca73aa0a |
14 | 1317b8a2b0a47d |
15 | 7724c31290341 |
hex | 3724f923595cf |
970111011100111 has 2 divisors, whose sum is σ = 970111011100112. Its totient is φ = 970111011100110.
The previous prime is 970111011100109. The next prime is 970111011100117. The reversal of 970111011100111 is 111001110111079.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (111001110111079) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 970111011100111 - 21 = 970111011100109 is a prime.
It is a super-2 number, since 2×9701110111001112 (a number of 31 digits) contains 22 as substring.
Together with 970111011100109, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (970111011100117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 485055505550055 + 485055505550056.
It is an arithmetic number, because the mean of its divisors is an integer number (485055505550056).
Almost surely, 2970111011100111 is an apocalyptic number.
970111011100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
970111011100111 is an equidigital number, since it uses as much as digits as its factorization.
970111011100111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 63, while the sum is 25.
The spelling of 970111011100111 in words is "nine hundred seventy trillion, one hundred eleven billion, eleven million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •