Base | Representation |
---|---|
bin | 111010001101010011110… |
… | …010010001101100110001 |
3 | 112011101202021210001122021 |
4 | 322031103302101230301 |
5 | 1011014020140204301 |
6 | 12301330043511441 |
7 | 561664142025265 |
oct | 72152362215461 |
9 | 15141667701567 |
10 | 4000020241201 |
11 | 1302443167136 |
12 | 547292828581 |
13 | 23027b06488a |
14 | db85dccc0a5 |
15 | 6e0b2b578a1 |
hex | 3a353c91b31 |
4000020241201 has 2 divisors, whose sum is σ = 4000020241202. Its totient is φ = 4000020241200.
The previous prime is 4000020241199. The next prime is 4000020241207. The reversal of 4000020241201 is 1021420200004.
4000020241201 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., 3916658693025 + 83361548176 = 1979055^2 + 288724^2 .
It is a cyclic number.
It is not a de Polignac number, because 4000020241201 - 21 = 4000020241199 is a prime.
Together with 4000020241199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (4000020241207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000010120600 + 2000010120601.
It is an arithmetic number, because the mean of its divisors is an integer number (2000010120601).
Almost surely, 24000020241201 is an apocalyptic number.
It is an amenable number.
4000020241201 is a deficient number, since it is larger than the sum of its proper divisors (1).
4000020241201 is an equidigital number, since it uses as much as digits as its factorization.
4000020241201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 4000020241201 its reverse (1021420200004), we get a palindrome (5021440441205).
The spelling of 4000020241201 in words is "four trillion, twenty million, two hundred forty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •