Base | Representation |
---|---|
bin | 101010100001011000… |
… | …0001001111011101111 |
3 | 22201200211211122222021 |
4 | 1111002300021323233 |
5 | 2444002420424241 |
6 | 105541004531011 |
7 | 6411565113565 |
oct | 1250260117357 |
9 | 281624748867 |
10 | 91314233071 |
11 | 357a955a926 |
12 | 15844b50a67 |
13 | 87c31a1799 |
14 | 45c3685a35 |
15 | 259692e0d1 |
hex | 1542c09eef |
91314233071 has 2 divisors, whose sum is σ = 91314233072. Its totient is φ = 91314233070.
The previous prime is 91314233039. The next prime is 91314233077. The reversal of 91314233071 is 17033241319.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 91314233071 - 25 = 91314233039 is a prime.
It is a super-2 number, since 2×913142330712 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (91314233077) 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, 45657116535 + 45657116536.
It is an arithmetic number, because the mean of its divisors is an integer number (45657116536).
Almost surely, 291314233071 is an apocalyptic number.
91314233071 is a deficient number, since it is larger than the sum of its proper divisors (1).
91314233071 is an equidigital number, since it uses as much as digits as its factorization.
91314233071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 34.
The spelling of 91314233071 in words is "ninety-one billion, three hundred fourteen million, two hundred thirty-three thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •