Base | Representation |
---|---|
bin | 11000011111110101… |
… | …00100000000110111 |
3 | 1020221120122100112112 |
4 | 30033322210000313 |
5 | 203413342140431 |
6 | 10013015041235 |
7 | 643626256511 |
oct | 141772440067 |
9 | 36846570475 |
10 | 13151911991 |
11 | 5639a03159 |
12 | 267067021b |
13 | 13179bcc5a |
14 | 8ca9d0bb1 |
15 | 51e95cc2b |
hex | 30fea4037 |
13151911991 has 2 divisors, whose sum is σ = 13151911992. Its totient is φ = 13151911990.
The previous prime is 13151911961. The next prime is 13151912023. The reversal of 13151911991 is 19911915131.
13151911991 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is an emirp because it is prime and its reverse (19911915131) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13151911991 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13151911951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6575955995 + 6575955996.
It is an arithmetic number, because the mean of its divisors is an integer number (6575955996).
Almost surely, 213151911991 is an apocalyptic number.
13151911991 is a deficient number, since it is larger than the sum of its proper divisors (1).
13151911991 is an equidigital number, since it uses as much as digits as its factorization.
13151911991 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10935, while the sum is 41.
The spelling of 13151911991 in words is "thirteen billion, one hundred fifty-one million, nine hundred eleven thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •