Base | Representation |
---|---|
bin | 1000110101001100110… |
… | …1011101010000010111 |
3 | 112111121121202002010221 |
4 | 2031103031131100113 |
5 | 4441210243020431 |
6 | 153411003455211 |
7 | 13650521542423 |
oct | 2152315352027 |
9 | 474547662127 |
10 | 151719891991 |
11 | 59386a18498 |
12 | 254a2827507 |
13 | 113cb9a1c25 |
14 | 74b3d73b83 |
15 | 3e2eab2111 |
hex | 235335d417 |
151719891991 has 2 divisors, whose sum is σ = 151719891992. Its totient is φ = 151719891990.
The previous prime is 151719891937. The next prime is 151719892003. The reversal of 151719891991 is 199198917151.
151719891991 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 151719891991 - 225 = 151686337559 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (151719891931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75859945995 + 75859945996.
It is an arithmetic number, because the mean of its divisors is an integer number (75859945996).
Almost surely, 2151719891991 is an apocalyptic number.
151719891991 is a deficient number, since it is larger than the sum of its proper divisors (1).
151719891991 is an equidigital number, since it uses as much as digits as its factorization.
151719891991 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1837080, while the sum is 61.
The spelling of 151719891991 in words is "one hundred fifty-one billion, seven hundred nineteen million, eight hundred ninety-one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.002 sec. • engine limits •