Base | Representation |
---|---|
bin | 111010100001110010100… |
… | …011001000001110011101 |
3 | 112020111111212122112111002 |
4 | 322201302203020032131 |
5 | 1011344034331403123 |
6 | 12315404134240045 |
7 | 563403121061063 |
oct | 72416243101635 |
9 | 15214455575432 |
10 | 4022011200413 |
11 | 13107a8518298 |
12 | 54b5ab4b6025 |
13 | 23237406c78b |
14 | dc948798033 |
15 | 6e94d59c528 |
hex | 3a8728c839d |
4022011200413 has 2 divisors, whose sum is σ = 4022011200414. Its totient is φ = 4022011200412.
The previous prime is 4022011200409. The next prime is 4022011200433. The reversal of 4022011200413 is 3140021102204.
It is an a-pointer prime, because the next prime (4022011200433) can be obtained adding 4022011200413 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2504869651684 + 1517141548729 = 1582678^2 + 1231723^2 .
It is a cyclic number.
It is not a de Polignac number, because 4022011200413 - 22 = 4022011200409 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4022011200433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011005600206 + 2011005600207.
It is an arithmetic number, because the mean of its divisors is an integer number (2011005600207).
Almost surely, 24022011200413 is an apocalyptic number.
It is an amenable number.
4022011200413 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022011200413 is an equidigital number, since it uses as much as digits as its factorization.
4022011200413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 4022011200413 its reverse (3140021102204), we get a palindrome (7162032302617).
The spelling of 4022011200413 in words is "four trillion, twenty-two billion, eleven million, two hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •