Base | Representation |
---|---|
bin | 10100110101011010010011… |
… | …110100001000110001011000 |
3 | 110000102212102200210212221022 |
4 | 110311122103310020301120 |
5 | 44002241411411223112 |
6 | 522514502123502012 |
7 | 25205100223466666 |
oct | 2465322364106130 |
9 | 400385380725838 |
10 | 91631312211032 |
11 | 27218691a13200 |
12 | a33a919087908 |
13 | 3c18a460ca899 |
14 | 188ad9cbd7c36 |
15 | a8d819d8cd72 |
hex | 535693d08c58 |
91631312211032 has 24 divisors (see below), whose sum is σ = 188847590767500. Its totient is φ = 41650596459120.
The previous prime is 91631312210953. The next prime is 91631312211041. The reversal of 91631312211032 is 23011221313619.
It is a super-2 number, since 2×916313122110322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 91631312210983 and 91631312211001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 47330222282 + ... + 47330224217.
Almost surely, 291631312211032 is an apocalyptic number.
It is an amenable number.
91631312211032 is an abundant number, since it is smaller than the sum of its proper divisors (97216278556468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91631312211032 is a wasteful number, since it uses less digits than its factorization.
91631312211032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94660446527 (or 94660446512 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 35.
The spelling of 91631312211032 in words is "ninety-one trillion, six hundred thirty-one billion, three hundred twelve million, two hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •