Base | Representation |
---|---|
bin | 111101001011011111000… |
… | …001101011100000010001 |
3 | 112212220211022020011111021 |
4 | 331023133001223200101 |
5 | 1022340220230244433 |
6 | 12535220352315441 |
7 | 612513325312120 |
oct | 75133701534021 |
9 | 15786738204437 |
10 | 4204219774993 |
11 | 1380aaa506217 |
12 | 57a980842b81 |
13 | 2465c1428494 |
14 | 1076b1a23ab7 |
15 | 74564b1822d |
hex | 3d2df06b811 |
4204219774993 has 4 divisors (see below), whose sum is σ = 4804822600000. Its totient is φ = 3603616949988.
The previous prime is 4204219774973. The next prime is 4204219774999. The reversal of 4204219774993 is 3994779124024.
4204219774993 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4204219774993 - 213 = 4204219766801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4204219774999) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300301412493 + ... + 300301412506.
It is an arithmetic number, because the mean of its divisors is an integer number (1201205650000).
Almost surely, 24204219774993 is an apocalyptic number.
It is an amenable number.
4204219774993 is a deficient number, since it is larger than the sum of its proper divisors (600602825007).
4204219774993 is an equidigital number, since it uses as much as digits as its factorization.
4204219774993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600602825006.
The product of its (nonzero) digits is 27433728, while the sum is 61.
The spelling of 4204219774993 in words is "four trillion, two hundred four billion, two hundred nineteen million, seven hundred seventy-four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •