Base | Representation |
---|---|
bin | 111010101001011010110… |
… | …001011110011111011011 |
3 | 112021021122201112121121001 |
4 | 322221122301132133123 |
5 | 1012012323233234120 |
6 | 12323241020525431 |
7 | 564113111560603 |
oct | 72513261363733 |
9 | 15237581477531 |
10 | 4030202243035 |
11 | 131422110a901 |
12 | 5510b66b0877 |
13 | 23307b051a67 |
14 | dd0c4591c03 |
15 | 6ec7c732e0a |
hex | 3aa5ac5e7db |
4030202243035 has 8 divisors (see below), whose sum is σ = 4862962265616. Its totient is φ = 3206348745120.
The previous prime is 4030202243033. The next prime is 4030202243069. The reversal of 4030202243035 is 5303422020304.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4030202243035 - 21 = 4030202243033 is a prime.
It is a super-2 number, since 2×40302022430352 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4030202242994 and 4030202243012.
It is not an unprimeable number, because it can be changed into a prime (4030202243033) 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, 2226630169 + ... + 2226631978.
It is an arithmetic number, because the mean of its divisors is an integer number (607870283202).
Almost surely, 24030202243035 is an apocalyptic number.
4030202243035 is a deficient number, since it is larger than the sum of its proper divisors (832760022581).
4030202243035 is a wasteful number, since it uses less digits than its factorization.
4030202243035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4453262333.
The product of its (nonzero) digits is 17280, while the sum is 28.
Adding to 4030202243035 its reverse (5303422020304), we get a palindrome (9333624263339).
The spelling of 4030202243035 in words is "four trillion, thirty billion, two hundred two million, two hundred forty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •