Base | Representation |
---|---|
bin | 100111110000… |
… | …1011000110101 |
3 | 1110020002112000 |
4 | 1033201120311 |
5 | 20314034013 |
6 | 2022445513 |
7 | 342121620 |
oct | 117413065 |
9 | 43202460 |
10 | 20846133 |
11 | 10849010 |
12 | 6b93899 |
13 | 441b5b9 |
14 | 2aa8db7 |
15 | 1c6b973 |
hex | 13e1635 |
20846133 has 64 divisors (see below), whose sum is σ = 39690240. Its totient is φ = 10497600.
The previous prime is 20846129. The next prime is 20846153. The reversal of 20846133 is 33164802.
It is a happy number.
It is not a de Polignac number, because 20846133 - 22 = 20846129 is a prime.
It is a super-2 number, since 2×208461332 = 869122522107378, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20846097 and 20846106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20846153) 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 63 ways as a sum of consecutive naturals, for example, 76788 + ... + 77058.
It is an arithmetic number, because the mean of its divisors is an integer number (620160).
Almost surely, 220846133 is an apocalyptic number.
It is an amenable number.
20846133 is a deficient number, since it is larger than the sum of its proper divisors (18844107).
20846133 is a wasteful number, since it uses less digits than its factorization.
20846133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335 (or 329 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 20846133 is about 4565.7565638128. The cubic root of 20846133 is about 275.2169439622.
The spelling of 20846133 in words is "twenty million, eight hundred forty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •