Base | Representation |
---|---|
bin | 10011011001011110010… |
… | …000010101011011000001 |
3 | 11201102202112120022202211 |
4 | 103121132100111123001 |
5 | 133320011411431423 |
6 | 2500214222342121 |
7 | 165210336156556 |
oct | 23313620253301 |
9 | 4642675508684 |
10 | 1333021202113 |
11 | 474370798077 |
12 | 19642212a941 |
13 | 9891b3883a3 |
14 | 48738d58a2d |
15 | 24a1cdd010d |
hex | 1365e4156c1 |
1333021202113 has 16 divisors (see below), whose sum is σ = 1430427237120. Its totient is φ = 1237767575296.
The previous prime is 1333021202101. The next prime is 1333021202159. The reversal of 1333021202113 is 3112021203331.
It is a cyclic number.
It is not a de Polignac number, because 1333021202113 - 25 = 1333021202081 is a prime.
It is a super-3 number, since 3×13330212021133 (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 (1333021200113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 357531 + ... + 1671487.
It is an arithmetic number, because the mean of its divisors is an integer number (89401702320).
Almost surely, 21333021202113 is an apocalyptic number.
It is an amenable number.
1333021202113 is a deficient number, since it is larger than the sum of its proper divisors (97406035007).
1333021202113 is a wasteful number, since it uses less digits than its factorization.
1333021202113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1314776.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1333021202113 its reverse (3112021203331), we get a palindrome (4445042405444).
The spelling of 1333021202113 in words is "one trillion, three hundred thirty-three billion, twenty-one million, two hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •