Base | Representation |
---|---|
bin | 100110100000… |
… | …1101110010111 |
3 | 1101222212102110 |
4 | 1031001232113 |
5 | 20132122101 |
6 | 2000442103 |
7 | 333426150 |
oct | 115015627 |
9 | 41885373 |
10 | 20192151 |
11 | 10441731 |
12 | 6919333 |
13 | 424ca25 |
14 | 2978927 |
15 | 1b8ccd6 |
hex | 1341b97 |
20192151 has 8 divisors (see below), whose sum is σ = 30769024. Its totient is φ = 11538360.
The previous prime is 20192147. The next prime is 20192153. The reversal of 20192151 is 15129102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20192151 - 22 = 20192147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 961531 = 20192151 / (2 + 0 + 1 + 9 + 2 + 1 + 5 + 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 (20192153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 480745 + ... + 480786.
It is an arithmetic number, because the mean of its divisors is an integer number (3846128).
Almost surely, 220192151 is an apocalyptic number.
20192151 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20192151 is a deficient number, since it is larger than the sum of its proper divisors (10576873).
20192151 is an equidigital number, since it uses as much as digits as its factorization.
20192151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 961541.
The product of its (nonzero) digits is 180, while the sum is 21.
The square root of 20192151 is about 4493.5677362203. The cubic root of 20192151 is about 272.3082892527.
The spelling of 20192151 in words is "twenty million, one hundred ninety-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •