Base | Representation |
---|---|
bin | 1010111101101… |
… | …01100101100111 |
3 | 20102001112222102 |
4 | 11132311211213 |
5 | 142021014040 |
6 | 13043122315 |
7 | 2164505543 |
oct | 536654547 |
9 | 212045872 |
10 | 91969895 |
11 | 47a07386 |
12 | 2697339b |
13 | 16091774 |
14 | c300a23 |
15 | 811a515 |
hex | 57b5967 |
91969895 has 16 divisors (see below), whose sum is σ = 112524768. Its totient is φ = 72145920.
The previous prime is 91969877. The next prime is 91969897. The reversal of 91969895 is 59896919.
It is not a de Polignac number, because 91969895 - 26 = 91969831 is a prime.
It is a super-3 number, since 3×919698953 (a number of 25 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 self number, because there is not a number n which added to its sum of digits gives 91969895.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (91969897) 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 15 ways as a sum of consecutive naturals, for example, 93647 + ... + 94623.
It is an arithmetic number, because the mean of its divisors is an integer number (7032798).
Almost surely, 291969895 is an apocalyptic number.
91969895 is a deficient number, since it is larger than the sum of its proper divisors (20554873).
91969895 is a wasteful number, since it uses less digits than its factorization.
91969895 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1330.
The product of its digits is 1574640, while the sum is 56.
The square root of 91969895 is about 9590.0935866132. The cubic root of 91969895 is about 451.3864973310.
It can be divided in two parts, 9196 and 9895, that added together give a palindrome (19091).
The spelling of 91969895 in words is "ninety-one million, nine hundred sixty-nine thousand, eight hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •