Base | Representation |
---|---|
bin | 1011100101100100101… |
… | …1011001010000100001 |
3 | 201000211011021020012121 |
4 | 2321121023121100201 |
5 | 11230141022424011 |
6 | 231240554224241 |
7 | 20245002435211 |
oct | 2713113312041 |
9 | 630734236177 |
10 | 199064654881 |
11 | 77471898604 |
12 | 326b6425081 |
13 | 15a055cb921 |
14 | 98c5ba4241 |
15 | 52a12b4e71 |
hex | 2e592d9421 |
199064654881 has 4 divisors (see below), whose sum is σ = 209541742000. Its totient is φ = 188587567764.
The previous prime is 199064654861. The next prime is 199064654909. The reversal of 199064654881 is 188456460991.
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 a de Polignac number, because none of the positive numbers 2k-199064654881 is a prime.
It is a super-2 number, since 2×1990646548812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (199064654801) 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, 5238543531 + ... + 5238543568.
It is an arithmetic number, because the mean of its divisors is an integer number (52385435500).
Almost surely, 2199064654881 is an apocalyptic number.
It is an amenable number.
199064654881 is a deficient number, since it is larger than the sum of its proper divisors (10477087119).
199064654881 is a wasteful number, since it uses less digits than its factorization.
199064654881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10477087118.
The product of its (nonzero) digits is 14929920, while the sum is 61.
The spelling of 199064654881 in words is "one hundred ninety-nine billion, sixty-four million, six hundred fifty-four thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •