Base | Representation |
---|---|
bin | 101010100111010101… |
… | …0100011011101000011 |
3 | 22202012202220111222001 |
4 | 1111032222203131003 |
5 | 2444410101410311 |
6 | 110012504324431 |
7 | 6416542640665 |
oct | 1251652433503 |
9 | 282182814861 |
10 | 91514091331 |
11 | 358a1356343 |
12 | 1589ba73717 |
13 | 8825709400 |
14 | 460202c535 |
15 | 25a925b4c1 |
hex | 154eaa3743 |
91514091331 has 12 divisors (see below), whose sum is σ = 104924269512. Its totient is φ = 79505452416.
The previous prime is 91514091329. The next prime is 91514091343. The reversal of 91514091331 is 13319041519.
It is not a de Polignac number, because 91514091331 - 21 = 91514091329 is a prime.
It is a super-2 number, since 2×915140913312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (91514091371) 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 in 11 ways as a sum of consecutive naturals, for example, 15923701 + ... + 15929446.
It is an arithmetic number, because the mean of its divisors is an integer number (8743689126).
Almost surely, 291514091331 is an apocalyptic number.
91514091331 is a deficient number, since it is larger than the sum of its proper divisors (13410178181).
91514091331 is a wasteful number, since it uses less digits than its factorization.
91514091331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31853190 (or 31853177 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 37.
The spelling of 91514091331 in words is "ninety-one billion, five hundred fourteen million, ninety-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •