Base | Representation |
---|---|
bin | 100110001101… |
… | …0010000011101 |
3 | 1101200122200010 |
4 | 1030122100131 |
5 | 20111433433 |
6 | 1553153433 |
7 | 332153640 |
oct | 114322035 |
9 | 41618603 |
10 | 20030493 |
11 | 1034122a |
12 | 685b879 |
13 | 41c4282 |
14 | 2935a57 |
15 | 1b59e63 |
hex | 131a41d |
20030493 has 32 divisors (see below), whose sum is σ = 32219136. Its totient is φ = 10821888.
The previous prime is 20030489. The next prime is 20030497. The reversal of 20030493 is 39403002.
It is an interprime number because it is at equal distance from previous prime (20030489) and next prime (20030497).
It is not a de Polignac number, because 20030493 - 22 = 20030489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20030497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54396 + ... + 54762.
It is an arithmetic number, because the mean of its divisors is an integer number (1006848).
Almost surely, 220030493 is an apocalyptic number.
20030493 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20030493 is a deficient number, since it is larger than the sum of its proper divisors (12188643).
20030493 is a wasteful number, since it uses less digits than its factorization.
20030493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 20030493 is about 4475.5438775639. The cubic root of 20030493 is about 271.5796428370.
Adding to 20030493 its reverse (39403002), we get a palindrome (59433495).
The spelling of 20030493 in words is "twenty million, thirty thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •