Base | Representation |
---|---|
bin | 1011101011010101100… |
… | …01000011000110010101 |
3 | 1102100121221020102112222 |
4 | 11311222301003012111 |
5 | 23033201114414143 |
6 | 504152553352125 |
7 | 40662453640124 |
oct | 5655261030625 |
9 | 1370557212488 |
10 | 401223201173 |
11 | 145181045563 |
12 | 65914a08645 |
13 | 2bab1b97012 |
14 | 155c2811abb |
15 | a683eb8768 |
hex | 5d6ac43195 |
401223201173 has 2 divisors, whose sum is σ = 401223201174. Its totient is φ = 401223201172.
The previous prime is 401223201167. The next prime is 401223201227. The reversal of 401223201173 is 371102322104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 230652549169 + 170570652004 = 480263^2 + 413002^2 .
It is a cyclic number.
It is not a de Polignac number, because 401223201173 - 26 = 401223201109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (401223201103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200611600586 + 200611600587.
It is an arithmetic number, because the mean of its divisors is an integer number (200611600587).
Almost surely, 2401223201173 is an apocalyptic number.
It is an amenable number.
401223201173 is a deficient number, since it is larger than the sum of its proper divisors (1).
401223201173 is an equidigital number, since it uses as much as digits as its factorization.
401223201173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 401223201173 its reverse (371102322104), we get a palindrome (772325523277).
The spelling of 401223201173 in words is "four hundred one billion, two hundred twenty-three million, two hundred one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •