Base | Representation |
---|---|
bin | 111010100001110011001… |
… | …101111001100010110101 |
3 | 112020111112122202011112102 |
4 | 322201303031321202311 |
5 | 1011344100214144334 |
6 | 12315405214431445 |
7 | 563403315266225 |
oct | 72416315714265 |
9 | 15214478664472 |
10 | 4022022412469 |
11 | 1310803886056 |
12 | 54b5b3202585 |
13 | 232376496c29 |
14 | dc94a076085 |
15 | 6e94e56467e |
hex | 3a8733798b5 |
4022022412469 has 2 divisors, whose sum is σ = 4022022412470. Its totient is φ = 4022022412468.
The previous prime is 4022022412427. The next prime is 4022022412483. The reversal of 4022022412469 is 9642142202204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4021268196100 + 754216369 = 2005310^2 + 27463^2 .
It is a cyclic number.
It is not a de Polignac number, because 4022022412469 - 228 = 4021753977013 is a prime.
It is a super-2 number, since 2×40220224124692 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4022022412409) by changing a digit.
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 as a sum of consecutive naturals, namely, 2011011206234 + 2011011206235.
It is an arithmetic number, because the mean of its divisors is an integer number (2011011206235).
Almost surely, 24022022412469 is an apocalyptic number.
It is an amenable number.
4022022412469 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022022412469 is an equidigital number, since it uses as much as digits as its factorization.
4022022412469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 38.
The spelling of 4022022412469 in words is "four trillion, twenty-two billion, twenty-two million, four hundred twelve thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •