Base | Representation |
---|---|
bin | 101010110100000010… |
… | …1100011101101000001 |
3 | 22210022111110102202011 |
4 | 1111220011203231001 |
5 | 3001243243210031 |
6 | 110123102052521 |
7 | 6433242132241 |
oct | 1255005435501 |
9 | 283274412664 |
10 | 91940600641 |
11 | 35aa008807a |
12 | 1599a87a141 |
13 | 8892b9cb96 |
14 | 4642933b21 |
15 | 25d19096b1 |
hex | 1568163b41 |
91940600641 has 8 divisors (see below), whose sum is σ = 92896106600. Its totient is φ = 90987131520.
The previous prime is 91940600603. The next prime is 91940600669. The reversal of 91940600641 is 14600604919.
It can be written as a sum of positive squares in 4 ways, for example, as 15574041616 + 76366559025 = 124796^2 + 276345^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-91940600641 is a prime.
It is a super-2 number, since 2×919406006412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 91940600594 and 91940600603.
It is not an unprimeable number, because it can be changed into a prime (91940600041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 418380 + ... + 599101.
It is an arithmetic number, because the mean of its divisors is an integer number (11612013325).
Almost surely, 291940600641 is an apocalyptic number.
It is an amenable number.
91940600641 is a deficient number, since it is larger than the sum of its proper divisors (955505959).
91940600641 is a wasteful number, since it uses less digits than its factorization.
91940600641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1018419.
The product of its (nonzero) digits is 46656, while the sum is 40.
The spelling of 91940600641 in words is "ninety-one billion, nine hundred forty million, six hundred thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •