Base | Representation |
---|---|
bin | 111010011100111110011… |
… | …001100011111001110001 |
3 | 112020000011120120212211022 |
4 | 322130332121203321301 |
5 | 1011302442333403214 |
6 | 12313151133425225 |
7 | 563131033531526 |
oct | 72347631437161 |
9 | 15200146525738 |
10 | 4016841309809 |
11 | 1309595222a29 |
12 | 54a5a803b215 |
13 | 231a2bc69603 |
14 | dc5b7d1114d |
15 | 6e749787d8e |
hex | 3a73e663e71 |
4016841309809 has 2 divisors, whose sum is σ = 4016841309810. Its totient is φ = 4016841309808.
The previous prime is 4016841309769. The next prime is 4016841309839. The reversal of 4016841309809 is 9089031486104.
4016841309809 is digitally balanced in base 3, 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., 2174306549809 + 1842534760000 = 1474553^2 + 1357400^2 .
It is a cyclic number.
It is not a de Polignac number, because 4016841309809 - 224 = 4016824532593 is a prime.
It is a super-2 number, since 2×40168413098092 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4016841309839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2008420654904 + 2008420654905.
It is an arithmetic number, because the mean of its divisors is an integer number (2008420654905).
Almost surely, 24016841309809 is an apocalyptic number.
It is an amenable number.
4016841309809 is a deficient number, since it is larger than the sum of its proper divisors (1).
4016841309809 is an equidigital number, since it uses as much as digits as its factorization.
4016841309809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1492992, while the sum is 53.
The spelling of 4016841309809 in words is "four trillion, sixteen billion, eight hundred forty-one million, three hundred nine thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •