Base | Representation |
---|---|
bin | 100111011001101… |
… | …1010110011111101 |
3 | 10102010202202000020 |
4 | 1032303122303331 |
5 | 10201424231023 |
6 | 335105122353 |
7 | 44522452551 |
oct | 11663326375 |
9 | 3363682006 |
10 | 1322102013 |
11 | 6193238a1 |
12 | 30a9293b9 |
13 | 180ba60ab |
14 | c7835861 |
15 | 7b108de3 |
hex | 4ecdacfd |
1322102013 has 8 divisors (see below), whose sum is σ = 1796063328. Its totient is φ = 864771024.
The previous prime is 1322102009. The next prime is 1322102017. The reversal of 1322102013 is 3102012231.
It is an interprime number because it is at equal distance from previous prime (1322102009) and next prime (1322102017).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1322102013 - 22 = 1322102009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1322101983 and 1322102001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1322102017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4157395 + ... + 4157712.
It is an arithmetic number, because the mean of its divisors is an integer number (224507916).
Almost surely, 21322102013 is an apocalyptic number.
It is an amenable number.
1322102013 is a deficient number, since it is larger than the sum of its proper divisors (473961315).
1322102013 is an equidigital number, since it uses as much as digits as its factorization.
1322102013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8315163.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1322102013 is about 36360.7207436816. The cubic root of 1322102013 is about 1097.5432812082.
Adding to 1322102013 its reverse (3102012231), we get a palindrome (4424114244).
The spelling of 1322102013 in words is "one billion, three hundred twenty-two million, one hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •