Base | Representation |
---|---|
bin | 10011001111001110000… |
… | …000010000010010111001 |
3 | 11200101100020011212110111 |
4 | 103033032000100102321 |
5 | 133124434322224423 |
6 | 2451153514344321 |
7 | 164340445136206 |
oct | 23171600202271 |
9 | 4611306155414 |
10 | 1322011133113 |
11 | 46a7309022a0 |
12 | 19426aa2b0a1 |
13 | 97885346968 |
14 | 47db29c6cad |
15 | 245c650260d |
hex | 133ce0104b9 |
1322011133113 has 16 divisors (see below), whose sum is σ = 1540051407360. Its totient is φ = 1122954134400.
The previous prime is 1322011133101. The next prime is 1322011133117. The reversal of 1322011133113 is 3113311102231.
It is a cyclic number.
It is not a de Polignac number, because 1322011133113 - 29 = 1322011132601 is a prime.
It is a super-3 number, since 3×13220111331133 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1322011133117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66832620 + ... + 66852397.
It is an arithmetic number, because the mean of its divisors is an integer number (96253212960).
Almost surely, 21322011133113 is an apocalyptic number.
It is an amenable number.
1322011133113 is a deficient number, since it is larger than the sum of its proper divisors (218040274247).
1322011133113 is a wasteful number, since it uses less digits than its factorization.
1322011133113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133685088.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1322011133113 its reverse (3113311102231), we get a palindrome (4435322235344).
The spelling of 1322011133113 in words is "one trillion, three hundred twenty-two billion, eleven million, one hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •