Base | Representation |
---|---|
bin | 1001001001011001110111… |
… | …01111000100101110011001 |
3 | 2122012220121112010200101011 |
4 | 10210230323233010232121 |
5 | 10114023124003334113 |
6 | 110440221505253521 |
7 | 4144132643243206 |
oct | 444547357045631 |
9 | 78186545120334 |
10 | 20114334043033 |
11 | 645549420789a |
12 | 230a3619342a1 |
13 | b2ba0968c439 |
14 | 4d7778caacad |
15 | 24d3476d963d |
hex | 124b3bbc4b99 |
20114334043033 has 8 divisors (see below), whose sum is σ = 20530250964288. Its totient is φ = 19699765313904.
The previous prime is 20114334043003. The next prime is 20114334043039. The reversal of 20114334043033 is 33034043341102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20114334043033 - 29 = 20114334042521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20114334042986 and 20114334043004.
It is not an unprimeable number, because it can be changed into a prime (20114334043039) 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, 337017885 + ... + 337077562.
It is an arithmetic number, because the mean of its divisors is an integer number (2566281370536).
Almost surely, 220114334043033 is an apocalyptic number.
It is an amenable number.
20114334043033 is a deficient number, since it is larger than the sum of its proper divisors (415916921255).
20114334043033 is an equidigital number, since it uses as much as digits as its factorization.
20114334043033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674096063.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 20114334043033 its reverse (33034043341102), we get a palindrome (53148377384135).
The spelling of 20114334043033 in words is "twenty trillion, one hundred fourteen billion, three hundred thirty-four million, forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •