Base | Representation |
---|---|
bin | 1001010010001000110110… |
… | …00010111001001000101001 |
3 | 2200021121012221211112111111 |
4 | 10221010123002321020221 |
5 | 10133432224411113113 |
6 | 111230132230030321 |
7 | 4204615454660512 |
oct | 451043302711051 |
9 | 80247187745444 |
10 | 20414433301033 |
11 | 65607924390a2 |
12 | 23585544a83a1 |
13 | b510c3c31b95 |
14 | 5080c7289a09 |
15 | 25605d95313d |
hex | 12911b0b9229 |
20414433301033 has 8 divisors (see below), whose sum is σ = 20432283167808. Its totient is φ = 20396588664144.
The previous prime is 20414433300971. The next prime is 20414433301147. The reversal of 20414433301033 is 33010333441402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20414433301033 - 229 = 20413896430121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20414433300986 and 20414433301004.
It is not an unprimeable number, because it can be changed into a prime (20414433301333) 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, 6523260 + ... + 9131362.
It is an arithmetic number, because the mean of its divisors is an integer number (2554035395976).
Almost surely, 220414433301033 is an apocalyptic number.
It is an amenable number.
20414433301033 is a deficient number, since it is larger than the sum of its proper divisors (17849866775).
20414433301033 is a wasteful number, since it uses less digits than its factorization.
20414433301033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2614943.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 20414433301033 its reverse (33010333441402), we get a palindrome (53424766742435).
The spelling of 20414433301033 in words is "twenty trillion, four hundred fourteen billion, four hundred thirty-three million, three hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •