Base | Representation |
---|---|
bin | 1000011111111011011… |
… | …1111110111001100111 |
3 | 111221212200120222110012 |
4 | 2013332313332321213 |
5 | 4343012030243231 |
6 | 151024233120435 |
7 | 13356156412664 |
oct | 2077667767147 |
9 | 457780528405 |
10 | 146010009191 |
11 | 56a16930a92 |
12 | 2436a55911b |
13 | 109cba53857 |
14 | 70d18c4a6b |
15 | 3be8684e2b |
hex | 21fedfee67 |
146010009191 has 2 divisors, whose sum is σ = 146010009192. Its totient is φ = 146010009190.
The previous prime is 146010009179. The next prime is 146010009193. The reversal of 146010009191 is 191900010641.
It is a strong prime.
It is an emirp because it is prime and its reverse (191900010641) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 146010009191 - 218 = 146009747047 is a prime.
Together with 146010009193, 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 (146010009193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73005004595 + 73005004596.
It is an arithmetic number, because the mean of its divisors is an integer number (73005004596).
Almost surely, 2146010009191 is an apocalyptic number.
146010009191 is a deficient number, since it is larger than the sum of its proper divisors (1).
146010009191 is an equidigital number, since it uses as much as digits as its factorization.
146010009191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 32.
The spelling of 146010009191 in words is "one hundred forty-six billion, ten million, nine thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •