Base | Representation |
---|---|
bin | 1100010000011001011… |
… | …01010110110010001001 |
3 | 1111020222120121010001022 |
4 | 12020030231112302021 |
5 | 23344423210331101 |
6 | 521243155202225 |
7 | 42265514015165 |
oct | 6101455266211 |
9 | 1436876533038 |
10 | 421120011401 |
11 | 1526612a4581 |
12 | 697482a6375 |
13 | 309330822cb |
14 | 1654d115ca5 |
15 | ae4ab4ea1b |
hex | 620cb56c89 |
421120011401 has 2 divisors, whose sum is σ = 421120011402. Its totient is φ = 421120011400.
The previous prime is 421120011317. The next prime is 421120011437. The reversal of 421120011401 is 104110021124.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 420733849600 + 386161801 = 648640^2 + 19651^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-421120011401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 421120011401.
It is not a weakly prime, because it can be changed into another prime (421120041401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210560005700 + 210560005701.
It is an arithmetic number, because the mean of its divisors is an integer number (210560005701).
Almost surely, 2421120011401 is an apocalyptic number.
It is an amenable number.
421120011401 is a deficient number, since it is larger than the sum of its proper divisors (1).
421120011401 is an equidigital number, since it uses as much as digits as its factorization.
421120011401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 421120011401 its reverse (104110021124), we get a palindrome (525230032525).
The spelling of 421120011401 in words is "four hundred twenty-one billion, one hundred twenty million, eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •