Base | Representation |
---|---|
bin | 111111001100000… |
… | …010110110010001 |
3 | 2201212210202222211 |
4 | 333030002312101 |
5 | 4132342401001 |
6 | 253110032121 |
7 | 35161613461 |
oct | 7714026621 |
9 | 2655722884 |
10 | 1060122001 |
11 | 4a4458394 |
12 | 257048641 |
13 | 13b82a833 |
14 | a0b1bba1 |
15 | 6310a351 |
hex | 3f302d91 |
1060122001 has 2 divisors, whose sum is σ = 1060122002. Its totient is φ = 1060122000.
The previous prime is 1060121983. The next prime is 1060122013. The reversal of 1060122001 is 1002210601.
1060122001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 548683776 + 511438225 = 23424^2 + 22615^2 .
It is a cyclic number.
It is not a de Polignac number, because 1060122001 - 25 = 1060121969 is a prime.
It is a super-2 number, since 2×10601220012 = 2247717314008488002, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1060122071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530061000 + 530061001.
It is an arithmetic number, because the mean of its divisors is an integer number (530061001).
Almost surely, 21060122001 is an apocalyptic number.
It is an amenable number.
1060122001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1060122001 is an equidigital number, since it uses as much as digits as its factorization.
1060122001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1060122001 is about 32559.5147537552. The cubic root of 1060122001 is about 1019.6519384637.
Adding to 1060122001 its reverse (1002210601), we get a palindrome (2062332602).
The spelling of 1060122001 in words is "one billion, sixty million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •