Base | Representation |
---|---|
bin | 10011001111011001010… |
… | …101101110101101100111 |
3 | 11200101211111000221222210 |
4 | 103033121111232231213 |
5 | 133130332013441403 |
6 | 2451224430454503 |
7 | 164345244501000 |
oct | 23173125565547 |
9 | 4611744027883 |
10 | 1322201312103 |
11 | 46a819197611 |
12 | 194302664433 |
13 | 978b58729c9 |
14 | 47dcdd701a7 |
15 | 245d806bb03 |
hex | 133d956eb67 |
1322201312103 has 32 divisors (see below), whose sum is σ = 2074762624000. Its totient is φ = 748611950688.
The previous prime is 1322201312021. The next prime is 1322201312143. The reversal of 1322201312103 is 3012131022231.
It is a de Polignac number, because none of the positive numbers 2k-1322201312103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1322201312103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1322201312143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5782051 + ... + 6006372.
It is an arithmetic number, because the mean of its divisors is an integer number (64836332000).
Almost surely, 21322201312103 is an apocalyptic number.
1322201312103 is a deficient number, since it is larger than the sum of its proper divisors (752561311897).
1322201312103 is a wasteful number, since it uses less digits than its factorization.
1322201312103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11788556 (or 11788542 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1322201312103 its reverse (3012131022231), we get a palindrome (4334332334334).
The spelling of 1322201312103 in words is "one trillion, three hundred twenty-two billion, two hundred one million, three hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •