Base | Representation |
---|---|
bin | 10010101110101010… |
… | …000010010110010001 |
3 | 1220220111202011120110 |
4 | 102232222002112101 |
5 | 312141142440213 |
6 | 13123301431533 |
7 | 1311230144250 |
oct | 225652022621 |
9 | 56814664513 |
10 | 20110124433 |
11 | 858a706153 |
12 | 3a92a0b5a9 |
13 | 1b86454819 |
14 | d8ab90797 |
15 | 7ca7705c3 |
hex | 4aea82591 |
20110124433 has 8 divisors (see below), whose sum is σ = 30643999168. Its totient is φ = 11491499664.
The previous prime is 20110124413. The next prime is 20110124467. The reversal of 20110124433 is 33442101102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20110124433 - 26 = 20110124369 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 957624973 = 20110124433 / (2 + 0 + 1 + 1 + 0 + 1 + 2 + 4 + 4 + 3 + 3).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20110124413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 478812466 + ... + 478812507.
It is an arithmetic number, because the mean of its divisors is an integer number (3830499896).
Almost surely, 220110124433 is an apocalyptic number.
It is an amenable number.
20110124433 is a deficient number, since it is larger than the sum of its proper divisors (10533874735).
20110124433 is an equidigital number, since it uses as much as digits as its factorization.
20110124433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957624983.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 20110124433 its reverse (33442101102), we get a palindrome (53552225535).
The spelling of 20110124433 in words is "twenty billion, one hundred ten million, one hundred twenty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •