Base | Representation |
---|---|
bin | 11101000111011001001… |
… | …00111100110111110001 |
3 | 10112122012200221212100012 |
4 | 32203230210330313301 |
5 | 112342310242202121 |
6 | 2043324512304305 |
7 | 132163611430406 |
oct | 16435444746761 |
9 | 3478180855305 |
10 | 1000401522161 |
11 | 3562a4640498 |
12 | 141a74542095 |
13 | 73450520c12 |
14 | 365c38c62ad |
15 | 1b051b2ac5b |
hex | e8ec93cdf1 |
1000401522161 has 2 divisors, whose sum is σ = 1000401522162. Its totient is φ = 1000401522160.
The previous prime is 1000401522089. The next prime is 1000401522179. The reversal of 1000401522161 is 1612251040001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 733557990400 + 266843531761 = 856480^2 + 516569^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000401522161 - 222 = 1000397327857 is a prime.
It is not a weakly prime, because it can be changed into another prime (1000401522181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500200761080 + 500200761081.
It is an arithmetic number, because the mean of its divisors is an integer number (500200761081).
Almost surely, 21000401522161 is an apocalyptic number.
It is an amenable number.
1000401522161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000401522161 is an equidigital number, since it uses as much as digits as its factorization.
1000401522161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 1000401522161 its reverse (1612251040001), we get a palindrome (2612652562162).
The spelling of 1000401522161 in words is "one trillion, four hundred one million, five hundred twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •