Base | Representation |
---|---|
bin | 100110101011… |
… | …0010001100111 |
3 | 1102011010220002 |
4 | 1031112101213 |
5 | 20142320302 |
6 | 2002331515 |
7 | 334226441 |
oct | 115262147 |
9 | 42133802 |
10 | 20276327 |
11 | 104999a5 |
12 | 6959b9b |
13 | 427c136 |
14 | 299b491 |
15 | 1ba7c02 |
hex | 1356467 |
20276327 has 4 divisors (see below), whose sum is σ = 20292000. Its totient is φ = 20260656.
The previous prime is 20276323. The next prime is 20276351. The reversal of 20276327 is 72367202.
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 20276327 - 22 = 20276323 is a prime.
It is a super-3 number, since 3×202763273 (a number of 23 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 20276327.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20276323) 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 3 ways as a sum of consecutive naturals, for example, 5702 + ... + 8547.
It is an arithmetic number, because the mean of its divisors is an integer number (5073000).
Almost surely, 220276327 is an apocalyptic number.
20276327 is a deficient number, since it is larger than the sum of its proper divisors (15673).
20276327 is a wasteful number, since it uses less digits than its factorization.
20276327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15672.
The product of its (nonzero) digits is 7056, while the sum is 29.
The square root of 20276327 is about 4502.9242720703. The cubic root of 20276327 is about 272.6861595837.
The spelling of 20276327 in words is "twenty million, two hundred seventy-six thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •