Base | Representation |
---|---|
bin | 11011010000110001101011… |
… | …100001100111100001110111 |
3 | 120201112100010220000120122221 |
4 | 123100301223201213201313 |
5 | 111203420411404304121 |
6 | 1103001203421103211 |
7 | 34153332344604541 |
oct | 3320615341474167 |
9 | 521470126016587 |
10 | 119900111009911 |
11 | 3522739596a541 |
12 | 115455406b7b07 |
13 | 51b96bb91718b |
14 | 21872a6a68691 |
15 | dcdd25047b41 |
hex | 6d0c6b867877 |
119900111009911 has 2 divisors, whose sum is σ = 119900111009912. Its totient is φ = 119900111009910.
The previous prime is 119900111009839. The next prime is 119900111009969.
It is a happy number.
119900111009911 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 119900111009911 - 211 = 119900111007863 is a prime.
It is a zygodrome in base 10.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (119900111049911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59950055504955 + 59950055504956.
It is an arithmetic number, because the mean of its divisors is an integer number (59950055504956).
Almost surely, 2119900111009911 is an apocalyptic number.
119900111009911 is a deficient number, since it is larger than the sum of its proper divisors (1).
119900111009911 is an equidigital number, since it uses as much as digits as its factorization.
119900111009911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 43.
The spelling of 119900111009911 in words is "one hundred nineteen trillion, nine hundred billion, one hundred eleven million, nine thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •