Base | Representation |
---|---|
bin | 10011000001111110… |
… | …101011000111111001 |
3 | 1221202002202001211000 |
4 | 103001332223013321 |
5 | 313322140121213 |
6 | 13215401555213 |
7 | 1322244460560 |
oct | 230176530771 |
9 | 57662661730 |
10 | 20434301433 |
11 | 87366a3127 |
12 | 3b634a5b09 |
13 | 1c08669030 |
14 | dbbc58bd7 |
15 | 7e8e57c73 |
hex | 4c1fab1f9 |
20434301433 has 64 divisors (see below), whose sum is σ = 37465792000. Its totient is φ = 10718749440.
The previous prime is 20434301413. The next prime is 20434301453. The reversal of 20434301433 is 33410343402.
It is an interprime number because it is at equal distance from previous prime (20434301413) and next prime (20434301453).
It is not a de Polignac number, because 20434301433 - 225 = 20400747001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 20434301397 and 20434301406.
It is not an unprimeable number, because it can be changed into a prime (20434301413) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 421743 + ... + 467691.
It is an arithmetic number, because the mean of its divisors is an integer number (585403000).
Almost surely, 220434301433 is an apocalyptic number.
It is an amenable number.
20434301433 is a deficient number, since it is larger than the sum of its proper divisors (17031490567).
20434301433 is a wasteful number, since it uses less digits than its factorization.
20434301433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46159 (or 46153 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 20434301433 its reverse (33410343402), we get a palindrome (53844644835).
The spelling of 20434301433 in words is "twenty billion, four hundred thirty-four million, three hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •