Base | Representation |
---|---|
bin | 101101101000100101011011… |
… | …0010000110101001101111011 |
3 | 1221122020200000022020220201021 |
4 | 1123101022312100311031323 |
5 | 410103033011010241123 |
6 | 3541413330112403311 |
7 | 150356226342211615 |
oct | 13321126620651573 |
9 | 1848220008226637 |
10 | 401402111415163 |
11 | 1069987523a93a1 |
12 | 3902a502b46537 |
13 | 142c909770b4c1 |
14 | 7119d74431db5 |
15 | 31615cb80cc5d |
hex | 16d12b643537b |
401402111415163 has 2 divisors, whose sum is σ = 401402111415164. Its totient is φ = 401402111415162.
The previous prime is 401402111415157. The next prime is 401402111415271. The reversal of 401402111415163 is 361514111204104.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 401402111415163 - 213 = 401402111406971 is a prime.
It is a super-2 number, since 2×4014021114151632 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (401402111412163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200701055707581 + 200701055707582.
It is an arithmetic number, because the mean of its divisors is an integer number (200701055707582).
Almost surely, 2401402111415163 is an apocalyptic number.
401402111415163 is a deficient number, since it is larger than the sum of its proper divisors (1).
401402111415163 is an equidigital number, since it uses as much as digits as its factorization.
401402111415163 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11520, while the sum is 34.
Adding to 401402111415163 its reverse (361514111204104), we get a palindrome (762916222619267).
It can be divided in two parts, 4014021 and 11415163, that added together give a square (15429184 = 39282).
The spelling of 401402111415163 in words is "four hundred one trillion, four hundred two billion, one hundred eleven million, four hundred fifteen thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •