Base | Representation |
---|---|
bin | 101010100001010101… |
… | …1100100100010010111 |
3 | 22201200202120121110221 |
4 | 1111002223210202113 |
5 | 2444002114000234 |
6 | 105540523055211 |
7 | 6411551650126 |
oct | 1250253444227 |
9 | 281622517427 |
10 | 91313031319 |
11 | 357a8909a44 |
12 | 15844671507 |
13 | 87c2b707a3 |
14 | 45c3451abd |
15 | 2596792eb4 |
hex | 1542ae4897 |
91313031319 has 8 divisors (see below), whose sum is σ = 92252099088. Its totient is φ = 90374649600.
The previous prime is 91313031301. The next prime is 91313031353.
91313031319 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 91313031319 - 29 = 91313030807 is a prime.
It is a super-2 number, since 2×913130313192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (91313032319) 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 in 7 ways as a sum of consecutive naturals, for example, 98224 + ... + 438490.
It is an arithmetic number, because the mean of its divisors is an integer number (11531512386).
Almost surely, 291313031319 is an apocalyptic number.
91313031319 is a deficient number, since it is larger than the sum of its proper divisors (939067769).
91313031319 is a wasteful number, since it uses less digits than its factorization.
91313031319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343025.
The product of its (nonzero) digits is 6561, while the sum is 34.
It can be divided in two parts, 913130 and 31319, that added together give a palindrome (944449).
The spelling of 91313031319 in words is "ninety-one billion, three hundred thirteen million, thirty-one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •