Base | Representation |
---|---|
bin | 111010100001010000101… |
… | …000111101010110110101 |
3 | 112020110001020011120111211 |
4 | 322201100220331112311 |
5 | 1011341403212202123 |
6 | 12315231453001421 |
7 | 563353042403203 |
oct | 72412050752665 |
9 | 15213036146454 |
10 | 4021442303413 |
11 | 1310536383587 |
12 | 54b470a83271 |
13 | 2322b3243c32 |
14 | dc8d2dca073 |
15 | 6e91867540d |
hex | 3a850a3d5b5 |
4021442303413 has 2 divisors, whose sum is σ = 4021442303414. Its totient is φ = 4021442303412.
The previous prime is 4021442303381. The next prime is 4021442303471. The reversal of 4021442303413 is 3143032441204.
4021442303413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2654315448849 + 1367126854564 = 1629207^2 + 1169242^2 .
It is a cyclic number.
It is not a de Polignac number, because 4021442303413 - 25 = 4021442303381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4021442300413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010721151706 + 2010721151707.
It is an arithmetic number, because the mean of its divisors is an integer number (2010721151707).
Almost surely, 24021442303413 is an apocalyptic number.
It is an amenable number.
4021442303413 is a deficient number, since it is larger than the sum of its proper divisors (1).
4021442303413 is an equidigital number, since it uses as much as digits as its factorization.
4021442303413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 4021442303413 its reverse (3143032441204), we get a palindrome (7164474744617).
The spelling of 4021442303413 in words is "four trillion, twenty-one billion, four hundred forty-two million, three hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •