Base | Representation |
---|---|
bin | 11010110000000001101… |
… | …10100111100010110011 |
3 | 10020212110021000121202022 |
4 | 31120000312213202303 |
5 | 110024343123202331 |
6 | 1542125034342055 |
7 | 123256036206515 |
oct | 15300066474263 |
9 | 3225407017668 |
10 | 919137319091 |
11 | 324893066992 |
12 | 12a17528a92b |
13 | 6889c505864 |
14 | 326b4ca7bb5 |
15 | 18d9768d67b |
hex | d600da78b3 |
919137319091 has 4 divisors (see below), whose sum is σ = 973204220232. Its totient is φ = 865070417952.
The previous prime is 919137319073. The next prime is 919137319099. The reversal of 919137319091 is 190913731919.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 190913731919 = 1373 ⋅139048603.
It is a cyclic number.
It is not a de Polignac number, because 919137319091 - 210 = 919137318067 is a prime.
It is a super-2 number, since 2×9191373190912 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (919137319099) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 27033450545 + ... + 27033450578.
It is an arithmetic number, because the mean of its divisors is an integer number (243301055058).
Almost surely, 2919137319091 is an apocalyptic number.
919137319091 is a deficient number, since it is larger than the sum of its proper divisors (54066901141).
919137319091 is a wasteful number, since it uses less digits than its factorization.
919137319091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54066901140.
The product of its (nonzero) digits is 413343, while the sum is 53.
The spelling of 919137319091 in words is "nine hundred nineteen billion, one hundred thirty-seven million, three hundred nineteen thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •