Base | Representation |
---|---|
bin | 10100110001111101001011… |
… | …011011111001010000011111 |
3 | 102222121011120021020100101102 |
4 | 110301331023123321100133 |
5 | 43434344123410221244 |
6 | 522213433313503315 |
7 | 25151663262062336 |
oct | 2461751333712037 |
9 | 388534507210342 |
10 | 91393874695199 |
11 | 27136a196a527a |
12 | a3008b3871b3b |
13 | 3bcc53689519b |
14 | 187d6b69c2d1d |
15 | a8756eda154e |
hex | 531f4b6f941f |
91393874695199 has 2 divisors, whose sum is σ = 91393874695200. Its totient is φ = 91393874695198.
The previous prime is 91393874695153. The next prime is 91393874695219. The reversal of 91393874695199 is 99159647839319.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 91393874695199 - 228 = 91393606259743 is a prime.
It is a super-2 number, since 2×913938746951992 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (91393874635199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45696937347599 + 45696937347600.
It is an arithmetic number, because the mean of its divisors is an integer number (45696937347600).
Almost surely, 291393874695199 is an apocalyptic number.
91393874695199 is a deficient number, since it is larger than the sum of its proper divisors (1).
91393874695199 is an equidigital number, since it uses as much as digits as its factorization.
91393874695199 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3571283520, while the sum is 83.
The spelling of 91393874695199 in words is "ninety-one trillion, three hundred ninety-three billion, eight hundred seventy-four million, six hundred ninety-five thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •