Base | Representation |
---|---|
bin | 10100110101011010010011… |
… | …110100001000110001010111 |
3 | 110000102212102200210212221021 |
4 | 110311122103310020301113 |
5 | 44002241411411223111 |
6 | 522514502123502011 |
7 | 25205100223466665 |
oct | 2465322364106127 |
9 | 400385380725837 |
10 | 91631312211031 |
11 | 27218691a131aa |
12 | a33a919087907 |
13 | 3c18a460ca898 |
14 | 188ad9cbd7c35 |
15 | a8d819d8cd71 |
hex | 535693d08c57 |
91631312211031 has 16 divisors (see below), whose sum is σ = 96861021827328. Its totient is φ = 86560704921600.
The previous prime is 91631312210953. The next prime is 91631312211041. The reversal of 91631312211031 is 13011221313619.
It is a cyclic number.
It is not a de Polignac number, because 91631312211031 - 211 = 91631312208983 is a prime.
It is a super-3 number, since 3×916313122110313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (91631312211041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 141226410 + ... + 141873751.
It is an arithmetic number, because the mean of its divisors is an integer number (6053813864208).
Almost surely, 291631312211031 is an apocalyptic number.
91631312211031 is a deficient number, since it is larger than the sum of its proper divisors (5229709616297).
91631312211031 is a wasteful number, since it uses less digits than its factorization.
91631312211031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283100442.
The product of its (nonzero) digits is 5832, while the sum is 34.
The spelling of 91631312211031 in words is "ninety-one trillion, six hundred thirty-one billion, three hundred twelve million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •