Base | Representation |
---|---|
bin | 101101100101111001110000… |
… | …0000110011101001111111001 |
3 | 1221120221102102101112001200011 |
4 | 1123023303200012131033321 |
5 | 410031012444203314121 |
6 | 3540532115524341521 |
7 | 150320465435162215 |
oct | 13313634006351771 |
9 | 1846842371461604 |
10 | 401033446151161 |
11 | 106866369482a2a |
12 | 38b8ab758448a1 |
13 | 142a03a3b42a85 |
14 | 710619da7b945 |
15 | 3156c00ce07e1 |
hex | 16cbce019d3f9 |
401033446151161 has 2 divisors, whose sum is σ = 401033446151162. Its totient is φ = 401033446151160.
The previous prime is 401033446151159. The next prime is 401033446151207. The reversal of 401033446151161 is 161151644330104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 385217362572025 + 15816083579136 = 19626955^2 + 3976944^2 .
It is a cyclic number.
It is not a de Polignac number, because 401033446151161 - 21 = 401033446151159 is a prime.
It is a super-2 number, since 2×4010334461511612 (a number of 30 digits) contains 22 as substring.
Together with 401033446151159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (401033446151111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200516723075580 + 200516723075581.
It is an arithmetic number, because the mean of its divisors is an integer number (200516723075581).
Almost surely, 2401033446151161 is an apocalyptic number.
It is an amenable number.
401033446151161 is a deficient number, since it is larger than the sum of its proper divisors (1).
401033446151161 is an equidigital number, since it uses as much as digits as its factorization.
401033446151161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 103680, while the sum is 40.
The spelling of 401033446151161 in words is "four hundred one trillion, thirty-three billion, four hundred forty-six million, one hundred fifty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •