Base | Representation |
---|---|
bin | 1011001001000110000… |
… | …1100101001101011001 |
3 | 200022002101121121011120 |
4 | 2302101201211031121 |
5 | 11114012013414010 |
6 | 223534232115453 |
7 | 16554365445102 |
oct | 2622141451531 |
9 | 608071547146 |
10 | 191420060505 |
11 | 741a96a7713 |
12 | 31122235b89 |
13 | 150878b52bb |
14 | 939c7b33a9 |
15 | 4ea50bee70 |
hex | 2c91865359 |
191420060505 has 32 divisors (see below), whose sum is σ = 307965979776. Its totient is φ = 101526441984.
The previous prime is 191420060501. The next prime is 191420060509. The reversal of 191420060505 is 505060024191.
It is an interprime number because it is at equal distance from previous prime (191420060501) and next prime (191420060509).
It is not a de Polignac number, because 191420060505 - 22 = 191420060501 is a prime.
It is not an unprimeable number, because it can be changed into a prime (191420060501) 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 31 ways as a sum of consecutive naturals, for example, 9755034 + ... + 9774636.
It is an arithmetic number, because the mean of its divisors is an integer number (9623936868).
Almost surely, 2191420060505 is an apocalyptic number.
191420060505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
191420060505 is a deficient number, since it is larger than the sum of its proper divisors (116545919271).
191420060505 is a wasteful number, since it uses less digits than its factorization.
191420060505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23177.
The product of its (nonzero) digits is 10800, while the sum is 33.
Adding to 191420060505 its reverse (505060024191), we get a palindrome (696480084696).
The spelling of 191420060505 in words is "one hundred ninety-one billion, four hundred twenty million, sixty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •