Base | Representation |
---|---|
bin | 10100110011101100110011… |
… | …000011010000001000110000 |
3 | 110000000121220211002201002021 |
4 | 110303230303003100020300 |
5 | 43443330102003311131 |
6 | 522344454050401224 |
7 | 25163435260035133 |
oct | 2463546303201060 |
9 | 400017824081067 |
10 | 91513724666416 |
11 | 271828308a8568 |
12 | a31bb81290214 |
13 | 3c0a926970510 |
14 | 188540603421a |
15 | a8a736abde11 |
hex | 533b330d0230 |
91513724666416 has 160 divisors (see below), whose sum is σ = 200482848276480. Its totient is φ = 40150614822912.
The previous prime is 91513724666407. The next prime is 91513724666443. The reversal of 91513724666416 is 61466642731519.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 5623646056 + ... + 5623662328.
It is an arithmetic number, because the mean of its divisors is an integer number (1253017801728).
Almost surely, 291513724666416 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 91513724666416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100241424138240).
91513724666416 is an abundant number, since it is smaller than the sum of its proper divisors (108969123610064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
91513724666416 is a wasteful number, since it uses less digits than its factorization.
91513724666416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23523 (or 23517 counting only the distinct ones).
The product of its digits is 39191040, while the sum is 61.
The spelling of 91513724666416 in words is "ninety-one trillion, five hundred thirteen billion, seven hundred twenty-four million, six hundred sixty-six thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •