Base | Representation |
---|---|
bin | 1011001110101001110… |
… | …0111101010110101111 |
3 | 200102221101000001002101 |
4 | 2303222130331112233 |
5 | 11130040434132121 |
6 | 224342250035531 |
7 | 16636353056641 |
oct | 2635234752657 |
9 | 612841001071 |
10 | 192912020911 |
11 | 748a4896645 |
12 | 31479a18ba7 |
13 | 15264a210cc |
14 | 94a09c2891 |
15 | 504107c491 |
hex | 2cea73d5af |
192912020911 has 4 divisors (see below), whose sum is σ = 198125859352. Its totient is φ = 187698182472.
The previous prime is 192912020893. The next prime is 192912020947. The reversal of 192912020911 is 119020219291.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 192912020911 - 27 = 192912020783 is a prime.
It is a super-2 number, since 2×1929120209112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37), and also a Moran number because the ratio is a prime number: 5213838403 = 192912020911 / (1 + 9 + 2 + 9 + 1 + 2 + 0 + 2 + 0 + 9 + 1 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (192912020981) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2606919165 + ... + 2606919238.
It is an arithmetic number, because the mean of its divisors is an integer number (49531464838).
Almost surely, 2192912020911 is an apocalyptic number.
192912020911 is a deficient number, since it is larger than the sum of its proper divisors (5213838441).
192912020911 is an equidigital number, since it uses as much as digits as its factorization.
192912020911 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5213838440.
The product of its (nonzero) digits is 5832, while the sum is 37.
The spelling of 192912020911 in words is "one hundred ninety-two billion, nine hundred twelve million, twenty thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •