Base | Representation |
---|---|
bin | 1011000111100100110… |
… | …1011000011010000001 |
3 | 200021000221222200000201 |
4 | 2301321031120122001 |
5 | 11112143100041001 |
6 | 223425540245201 |
7 | 16541313106624 |
oct | 2617115303201 |
9 | 607027880021 |
10 | 191012112001 |
11 | 7400a3a2997 |
12 | 310296a0801 |
13 | 1502121cb59 |
14 | 936053ddbb |
15 | 4e7e38b501 |
hex | 2c79358681 |
191012112001 has 8 divisors (see below), whose sum is σ = 193326295680. Its totient is φ = 188698234032.
The previous prime is 191012111999. The next prime is 191012112019. The reversal of 191012112001 is 100211210191.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 191012112001 - 21 = 191012111999 is a prime.
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 191012112001.
It is not an unprimeable number, because it can be changed into a prime (191012112601) 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 7 ways as a sum of consecutive naturals, for example, 1338355 + ... + 1474183.
It is an arithmetic number, because the mean of its divisors is an integer number (24165786960).
Almost surely, 2191012112001 is an apocalyptic number.
It is an amenable number.
191012112001 is a deficient number, since it is larger than the sum of its proper divisors (2314183679).
191012112001 is a wasteful number, since it uses less digits than its factorization.
191012112001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152855.
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 191012112001 its reverse (100211210191), we get a palindrome (291223322192).
The spelling of 191012112001 in words is "one hundred ninety-one billion, twelve million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •