Base | Representation |
---|---|
bin | 101010011000111110… |
… | …0010010100001011111 |
3 | 22200222012010222010112 |
4 | 1110301330102201133 |
5 | 2442413220420221 |
6 | 105453012000235 |
7 | 6401601641552 |
oct | 1246174224137 |
9 | 280865128115 |
10 | 91032201311 |
11 | 35674339227 |
12 | 1578660007b |
13 | 877992539c |
14 | 459802c699 |
15 | 257bcbe15b |
hex | 1531f1285f |
91032201311 has 2 divisors, whose sum is σ = 91032201312. Its totient is φ = 91032201310.
The previous prime is 91032201301. The next prime is 91032201317. The reversal of 91032201311 is 11310223019.
It is a strong prime.
It is an emirp because it is prime and its reverse (11310223019) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-91032201311 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (91032201317) 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, 45516100655 + 45516100656.
It is an arithmetic number, because the mean of its divisors is an integer number (45516100656).
Almost surely, 291032201311 is an apocalyptic number.
91032201311 is a deficient number, since it is larger than the sum of its proper divisors (1).
91032201311 is an equidigital number, since it uses as much as digits as its factorization.
91032201311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 91032201311 in words is "ninety-one billion, thirty-two million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •