Base | Representation |
---|---|
bin | 10010110000101100… |
… | …000100100010100101 |
3 | 1220222212220000002212 |
4 | 102300230010202211 |
5 | 312223404242013 |
6 | 13130520213205 |
7 | 1312122656303 |
oct | 226054044245 |
9 | 56885800085 |
10 | 20144212133 |
11 | 85a7978801 |
12 | 3aa230a205 |
13 | 1b9052b266 |
14 | d91505273 |
15 | 7cd7556a8 |
hex | 4b0b048a5 |
20144212133 has 8 divisors (see below), whose sum is σ = 20644982400. Its totient is φ = 19649586528.
The previous prime is 20144212073. The next prime is 20144212139. The reversal of 20144212133 is 33121244102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20144212133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20144212099 and 20144212108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20144212139) 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 7 ways as a sum of consecutive naturals, for example, 1529528 + ... + 1542641.
It is an arithmetic number, because the mean of its divisors is an integer number (2580622800).
Almost surely, 220144212133 is an apocalyptic number.
It is an amenable number.
20144212133 is a deficient number, since it is larger than the sum of its proper divisors (500770267).
20144212133 is an equidigital number, since it uses as much as digits as its factorization.
20144212133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3072331.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 20144212133 its reverse (33121244102), we get a palindrome (53265456235).
The spelling of 20144212133 in words is "twenty billion, one hundred forty-four million, two hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •