Base | Representation |
---|---|
bin | 111010100001110011010… |
… | …100010110010101100101 |
3 | 112020111112202221001212122 |
4 | 322201303110112111211 |
5 | 1011344101132301034 |
6 | 12315405314555325 |
7 | 563403335540534 |
oct | 72416324262545 |
9 | 15214482831778 |
10 | 4022024103269 |
11 | 1310804830407 |
12 | 54b5b3898b45 |
13 | 2323769396c3 |
14 | dc94a39631b |
15 | 6e94e79a62e |
hex | 3a873516565 |
4022024103269 has 2 divisors, whose sum is σ = 4022024103270. Its totient is φ = 4022024103268.
The previous prime is 4022024103199. The next prime is 4022024103313. The reversal of 4022024103269 is 9623014202204.
4022024103269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3588088350625 + 433935752644 = 1894225^2 + 658738^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4022024103269 is a prime.
It is a super-2 number, since 2×40220241032692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4022024103469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011012051634 + 2011012051635.
It is an arithmetic number, because the mean of its divisors is an integer number (2011012051635).
Almost surely, 24022024103269 is an apocalyptic number.
It is an amenable number.
4022024103269 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022024103269 is an equidigital number, since it uses as much as digits as its factorization.
4022024103269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
The spelling of 4022024103269 in words is "four trillion, twenty-two billion, twenty-four million, one hundred three thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •