Base | Representation |
---|---|
bin | 100111000001… |
… | …1111101001001 |
3 | 1102111122112221 |
4 | 1032003331021 |
5 | 20214312213 |
6 | 2010334041 |
7 | 335636104 |
oct | 116037511 |
9 | 42448487 |
10 | 20463433 |
11 | 10607531 |
12 | 6a2a321 |
13 | 4316353 |
14 | 2a0973b |
15 | 1be338d |
hex | 1383f49 |
20463433 has 4 divisors (see below), whose sum is σ = 20743828. Its totient is φ = 20183040.
The previous prime is 20463409. The next prime is 20463451. The reversal of 20463433 is 33436402.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8684809 + 11778624 = 2947^2 + 3432^2 .
It is not a de Polignac number, because 20463433 - 29 = 20462921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20463398 and 20463407.
It is not an unprimeable number, because it can be changed into a prime (20463403) 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, 140088 + ... + 140233.
It is an arithmetic number, because the mean of its divisors is an integer number (5185957).
Almost surely, 220463433 is an apocalyptic number.
It is an amenable number.
20463433 is a deficient number, since it is larger than the sum of its proper divisors (280395).
20463433 is an equidigital number, since it uses as much as digits as its factorization.
20463433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280394.
The product of its (nonzero) digits is 5184, while the sum is 25.
The square root of 20463433 is about 4523.6526170784. The cubic root of 20463433 is about 273.5223576824.
Adding to 20463433 its reverse (33436402), we get a palindrome (53899835).
The spelling of 20463433 in words is "twenty million, four hundred sixty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •