Base | Representation |
---|---|
bin | 1001001100010011101110… |
… | …00010001000001010011001 |
3 | 2122120110011022010001112221 |
4 | 10212021313002020022121 |
5 | 10122142000431011101 |
6 | 110554122501504041 |
7 | 4154264365501504 |
oct | 446116702101231 |
9 | 78513138101487 |
10 | 20214113141401 |
11 | 6493836984263 |
12 | 2325769712021 |
13 | b3824b4a6c4a |
14 | 4dc52286813b |
15 | 250c3733baa1 |
hex | 126277088299 |
20214113141401 has 2 divisors, whose sum is σ = 20214113141402. Its totient is φ = 20214113141400.
The previous prime is 20214113141357. The next prime is 20214113141413. The reversal of 20214113141401 is 10414131141202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17004497569801 + 3209615571600 = 4123651^2 + 1791540^2 .
It is a cyclic number.
It is not a de Polignac number, because 20214113141401 - 27 = 20214113141273 is a prime.
It is a super-2 number, since 2×202141131414012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20214113141441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10107056570700 + 10107056570701.
It is an arithmetic number, because the mean of its divisors is an integer number (10107056570701).
Almost surely, 220214113141401 is an apocalyptic number.
It is an amenable number.
20214113141401 is a deficient number, since it is larger than the sum of its proper divisors (1).
20214113141401 is an equidigital number, since it uses as much as digits as its factorization.
20214113141401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 20214113141401 its reverse (10414131141202), we get a palindrome (30628244282603).
The spelling of 20214113141401 in words is "twenty trillion, two hundred fourteen billion, one hundred thirteen million, one hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •