Base | Representation |
---|---|
bin | 1001010100000011000… |
… | …10111111000111000001 |
3 | 1010120222102100201102022 |
4 | 10222001202333013001 |
5 | 20220330224342121 |
6 | 403001220131225 |
7 | 32055631503215 |
oct | 4520142770701 |
9 | 1116872321368 |
10 | 320001012161 |
11 | 113791257816 |
12 | 52027836b15 |
13 | 2423979c14c |
14 | 116b960c945 |
15 | 84cd579aab |
hex | 4a818bf1c1 |
320001012161 has 2 divisors, whose sum is σ = 320001012162. Its totient is φ = 320001012160.
The previous prime is 320001012101. The next prime is 320001012209. The reversal of 320001012161 is 161210100023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 288094121536 + 31906890625 = 536744^2 + 178625^2 .
It is a cyclic number.
It is not a de Polignac number, because 320001012161 - 222 = 319996817857 is a prime.
It is not a weakly prime, because it can be changed into another prime (320001012101) 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, 160000506080 + 160000506081.
It is an arithmetic number, because the mean of its divisors is an integer number (160000506081).
Almost surely, 2320001012161 is an apocalyptic number.
It is an amenable number.
320001012161 is a deficient number, since it is larger than the sum of its proper divisors (1).
320001012161 is an equidigital number, since it uses as much as digits as its factorization.
320001012161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 320001012161 its reverse (161210100023), we get a palindrome (481211112184).
The spelling of 320001012161 in words is "three hundred twenty billion, one million, twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •