Base | Representation |
---|---|
bin | 101010110100110001… |
… | …0101000101100110001 |
3 | 22210101012101002001112 |
4 | 1111221202220230301 |
5 | 3001321020003442 |
6 | 110125333043105 |
7 | 6433656414656 |
oct | 1255142505461 |
9 | 283335332045 |
10 | 91965000497 |
11 | 36002933047 |
12 | 159a6a86495 |
13 | 8897c63b76 |
14 | 4645c85c2d |
15 | 25d3b29082 |
hex | 15698a8b31 |
91965000497 has 4 divisors (see below), whose sum is σ = 92011008000. Its totient is φ = 91918992996.
The previous prime is 91965000493. The next prime is 91965000503. The reversal of 91965000497 is 79400056919.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 91965000497 - 22 = 91965000493 is a prime.
It is a super-3 number, since 3×919650004973 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (91965000493) 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 3 ways as a sum of consecutive naturals, for example, 23000753 + ... + 23004750.
It is an arithmetic number, because the mean of its divisors is an integer number (23002752000).
Almost surely, 291965000497 is an apocalyptic number.
It is an amenable number.
91965000497 is a deficient number, since it is larger than the sum of its proper divisors (46007503).
91965000497 is a wasteful number, since it uses less digits than its factorization.
91965000497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46007502.
The product of its (nonzero) digits is 612360, while the sum is 50.
The spelling of 91965000497 in words is "ninety-one billion, nine hundred sixty-five million, four hundred ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •