Base | Representation |
---|---|
bin | 111101001011011111000… |
… | …010101000011001111010 |
3 | 112212220211022200211200010 |
4 | 331023133002220121322 |
5 | 1022340220311240232 |
6 | 12535220401522350 |
7 | 612513330401304 |
oct | 75133702503172 |
9 | 15786738624603 |
10 | 4204220024442 |
11 | 1380aaa666679 |
12 | 57a9809433b6 |
13 | 2465c14b4b99 |
14 | 1076b1a8a974 |
15 | 74564b670cc |
hex | 3d2df0a867a |
4204220024442 has 8 divisors (see below), whose sum is σ = 8408440048896. Its totient is φ = 1401406674812.
The previous prime is 4204220024387. The next prime is 4204220024453. The reversal of 4204220024442 is 2444200224024.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
4204220024442 is an admirable number.
It is a super-2 number, since 2×42042200244422 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350351668698 + ... + 350351668709.
It is an arithmetic number, because the mean of its divisors is an integer number (1051055006112).
Almost surely, 24204220024442 is an apocalyptic number.
4204220024442 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4204220024442 is a wasteful number, since it uses less digits than its factorization.
4204220024442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700703337412.
The product of its (nonzero) digits is 32768, while the sum is 30.
Adding to 4204220024442 its reverse (2444200224024), we get a palindrome (6648420248466).
The spelling of 4204220024442 in words is "four trillion, two hundred four billion, two hundred twenty million, twenty-four thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •