Base | Representation |
---|---|
bin | 10000010101111000000… |
… | …101111111101111110001 |
3 | 10222100122220001222022212 |
4 | 100111320011333233301 |
5 | 121344401313131001 |
6 | 2215522155141505 |
7 | 144064006366025 |
oct | 20257005775761 |
9 | 3870586058285 |
10 | 1123001302001 |
11 | 3a3297a5a697 |
12 | 16178aa44895 |
13 | 81b8b201c47 |
14 | 3c4d4214385 |
15 | 1e329e6b7bb |
hex | 1057817fbf1 |
1123001302001 has 2 divisors, whose sum is σ = 1123001302002. Its totient is φ = 1123001302000.
The previous prime is 1123001301991. The next prime is 1123001302069. The reversal of 1123001302001 is 1002031003211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 866762862001 + 256238440000 = 931001^2 + 506200^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123001302001 - 210 = 1123001300977 is a prime.
It is a super-2 number, since 2×11230013020012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1123001301001) 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, 561500651000 + 561500651001.
It is an arithmetic number, because the mean of its divisors is an integer number (561500651001).
Almost surely, 21123001302001 is an apocalyptic number.
It is an amenable number.
1123001302001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123001302001 is an equidigital number, since it uses as much as digits as its factorization.
1123001302001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1123001302001 its reverse (1002031003211), we get a palindrome (2125032305212).
The spelling of 1123001302001 in words is "one trillion, one hundred twenty-three billion, one million, three hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •