Base | Representation |
---|---|
bin | 1111101110001100… |
… | …1111101010110001 |
3 | 101220010021111021012 |
4 | 3323203033222301 |
5 | 32120400223213 |
6 | 1534440040305 |
7 | 206404063130 |
oct | 37343175261 |
9 | 11803244235 |
10 | 4220320433 |
11 | 187629622a |
12 | 999463095 |
13 | 523471c34 |
14 | 2c0705917 |
15 | 19a7954a8 |
hex | fb8cfab1 |
4220320433 has 8 divisors (see below), whose sum is σ = 4823711040. Its totient is φ = 3617051760.
The previous prime is 4220320427. The next prime is 4220320477. The reversal of 4220320433 is 3340230224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4220320433 - 24 = 4220320417 is a prime.
It is a super-2 number, since 2×42203204332 = 35622209114394614978, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4220320399 and 4220320408.
It is not an unprimeable number, because it can be changed into a prime (4220320493) 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, 62678 + ... + 111216.
It is an arithmetic number, because the mean of its divisors is an integer number (602963880).
Almost surely, 24220320433 is an apocalyptic number.
It is an amenable number.
4220320433 is a deficient number, since it is larger than the sum of its proper divisors (603390607).
4220320433 is a wasteful number, since it uses less digits than its factorization.
4220320433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60967.
The product of its (nonzero) digits is 3456, while the sum is 23.
The square root of 4220320433 is about 64963.9933578594. The cubic root of 4220320433 is about 1616.0264901519.
Adding to 4220320433 its reverse (3340230224), we get a palindrome (7560550657).
The spelling of 4220320433 in words is "four billion, two hundred twenty million, three hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •