Base | Representation |
---|---|
bin | 10011001101010111010… |
… | …101001001100110100011 |
3 | 11200012012110202000200212 |
4 | 103031113111021212203 |
5 | 133111400122401034 |
6 | 2450224152204335 |
7 | 164240220623144 |
oct | 23152725114643 |
9 | 4605173660625 |
10 | 1320020122019 |
11 | 4698a9a45185 |
12 | 1939b40996ab |
13 | 976289c8ba1 |
14 | 47c643cbacb |
15 | 2450b8182ce |
hex | 133575499a3 |
1320020122019 has 4 divisors (see below), whose sum is σ = 1320125964696. Its totient is φ = 1319914279344.
The previous prime is 1320020121983. The next prime is 1320020122087. The reversal of 1320020122019 is 9102210200231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320020122019 is a prime.
It is a super-3 number, since 3×13200201220193 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1320020121985 and 1320020122003.
It is not an unprimeable number, because it can be changed into a prime (1320020142019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52902629 + ... + 52927574.
It is an arithmetic number, because the mean of its divisors is an integer number (330031491174).
Almost surely, 21320020122019 is an apocalyptic number.
1320020122019 is a deficient number, since it is larger than the sum of its proper divisors (105842677).
1320020122019 is a wasteful number, since it uses less digits than its factorization.
1320020122019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105842676.
The product of its (nonzero) digits is 432, while the sum is 23.
The spelling of 1320020122019 in words is "one trillion, three hundred twenty billion, twenty million, one hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •