Base | Representation |
---|---|
bin | 100111000001… |
… | …1011010011011 |
3 | 1102111112111122 |
4 | 1032003122123 |
5 | 20214224321 |
6 | 2010315455 |
7 | 335626451 |
oct | 116033233 |
9 | 42445448 |
10 | 20461211 |
11 | 106058a1 |
12 | 6a28b8b |
13 | 4315334 |
14 | 2a089d1 |
15 | 1be28ab |
hex | 138369b |
20461211 has 4 divisors (see below), whose sum is σ = 21166800. Its totient is φ = 19755624.
The previous prime is 20461193. The next prime is 20461223. The reversal of 20461211 is 11216402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20461211 is a prime.
It is a super-2 number, since 2×204612112 = 837322311173042, which contains 22 as substring.
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 20461211.
It is not an unprimeable number, because it can be changed into a prime (20461411) 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, 352751 + ... + 352808.
It is an arithmetic number, because the mean of its divisors is an integer number (5291700).
Almost surely, 220461211 is an apocalyptic number.
20461211 is a deficient number, since it is larger than the sum of its proper divisors (705589).
20461211 is an equidigital number, since it uses as much as digits as its factorization.
20461211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 705588.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 20461211 is about 4523.4070124188. The cubic root of 20461211 is about 273.5124572798.
Adding to 20461211 its reverse (11216402), we get a palindrome (31677613).
The spelling of 20461211 in words is "twenty million, four hundred sixty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •