Base | Representation |
---|---|
bin | 10000010101111111111… |
… | …001110010100100000001 |
3 | 10222101000000121101020101 |
4 | 100111333321302210001 |
5 | 121400133333220001 |
6 | 2215543155242401 |
7 | 144100160126506 |
oct | 20257771624401 |
9 | 3871000541211 |
10 | 1123132320001 |
11 | 3a3354a0742a |
12 | 1618068a9401 |
13 | 81bac3b5ba3 |
14 | 3c50779b4ad |
15 | 1e3366eba01 |
hex | 1057fe72901 |
1123132320001 has 2 divisors, whose sum is σ = 1123132320002. Its totient is φ = 1123132320000.
The previous prime is 1123132319999. The next prime is 1123132320029. The reversal of 1123132320001 is 1000232313211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 707911890625 + 415220429376 = 841375^2 + 644376^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123132320001 - 21 = 1123132319999 is a prime.
It is a super-2 number, since 2×11231323200012 (a number of 25 digits) contains 22 as substring.
Together with 1123132319999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1123132320901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561566160000 + 561566160001.
It is an arithmetic number, because the mean of its divisors is an integer number (561566160001).
Almost surely, 21123132320001 is an apocalyptic number.
It is an amenable number.
1123132320001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123132320001 is an equidigital number, since it uses as much as digits as its factorization.
1123132320001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1123132320001 its reverse (1000232313211), we get a palindrome (2123364633212).
The spelling of 1123132320001 in words is "one trillion, one hundred twenty-three billion, one hundred thirty-two million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •