Base | Representation |
---|---|
bin | 111101011010011111010… |
… | …010100100100001110000 |
3 | 112221110102002002011120001 |
4 | 331122133102210201300 |
5 | 1023121214031031344 |
6 | 12550443141355344 |
7 | 613623501625651 |
oct | 75323722444160 |
9 | 15843362064501 |
10 | 4220330330224 |
11 | 13879174a1878 |
12 | 581b18108b54 |
13 | 247c8b07c6b8 |
14 | 10839d533528 |
15 | 74ba919aed4 |
hex | 3d69f4a4870 |
4220330330224 has 10 divisors (see below), whose sum is σ = 8176890014840. Its totient is φ = 2110165165104.
The previous prime is 4220330330213. The next prime is 4220330330239.
4220330330224 is nontrivially palindromic in base 10.
4220330330224 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×42203303302242 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4220330330192 and 4220330330201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 131885322804 + ... + 131885322835.
It is an arithmetic number, because the mean of its divisors is an integer number (817689001484).
Almost surely, 24220330330224 is an apocalyptic number.
It is an amenable number.
4220330330224 is a deficient number, since it is larger than the sum of its proper divisors (3956559684616).
4220330330224 is a wasteful number, since it uses less digits than its factorization.
4220330330224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263770645647 (or 263770645641 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 28.
It can be divided in two parts, 4220330 and 330224, that added together give a palindrome (4550554).
The spelling of 4220330330224 in words is "four trillion, two hundred twenty billion, three hundred thirty million, three hundred thirty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •