Base | Representation |
---|---|
bin | 1110111110111101… |
… | …1111000001000001 |
3 | 101101022111001110111 |
4 | 3233233133001001 |
5 | 31214140434213 |
6 | 1503041431321 |
7 | 201450104464 |
oct | 35757370101 |
9 | 11338431414 |
10 | 4022202433 |
11 | 1784479247 |
12 | 94303b541 |
13 | 4c13c6452 |
14 | 2a22932db |
15 | 1881ada3d |
hex | efbdf041 |
4022202433 has 2 divisors, whose sum is σ = 4022202434. Its totient is φ = 4022202432.
The previous prime is 4022202419. The next prime is 4022202529. The reversal of 4022202433 is 3342022204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2349147024 + 1673055409 = 48468^2 + 40903^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4022202433 is a prime.
It is a super-2 number, since 2×40222024332 = 32356224824062238978, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4022202733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011101216 + 2011101217.
It is an arithmetic number, because the mean of its divisors is an integer number (2011101217).
Almost surely, 24022202433 is an apocalyptic number.
It is an amenable number.
4022202433 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022202433 is an equidigital number, since it uses as much as digits as its factorization.
4022202433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 22.
The square root of 4022202433 is about 63420.8359531787. The cubic root of 4022202433 is about 1590.3326483840.
Adding to 4022202433 its reverse (3342022204), we get a palindrome (7364224637).
The spelling of 4022202433 in words is "four billion, twenty-two million, two hundred two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •