Base | Representation |
---|---|
bin | 10011010110110110110… |
… | …001011111000100100101 |
3 | 11201011111201021112021200 |
4 | 103112312301133010211 |
5 | 133243233044220401 |
6 | 2455031325033113 |
7 | 165050606442666 |
oct | 23266661370445 |
9 | 4634451245250 |
10 | 1330211320101 |
11 | 473159680134 |
12 | 1959790b5799 |
13 | 985911ab201 |
14 | 4854dac136d |
15 | 24906392686 |
hex | 135b6c5f125 |
1330211320101 has 12 divisors (see below), whose sum is σ = 2004956192928. Its totient is φ = 848250696744.
The previous prime is 1330211320091. The next prime is 1330211320117. The reversal of 1330211320101 is 1010231120331.
1330211320101 is a `hidden beast` number, since 1 + 3 + 30 + 211 + 320 + 101 = 666.
It is not a de Polignac number, because 1330211320101 - 25 = 1330211320069 is a prime.
It is a super-2 number, since 2×13302113201012 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330211320171) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3213070615 + ... + 3213071028.
It is an arithmetic number, because the mean of its divisors is an integer number (167079682744).
Almost surely, 21330211320101 is an apocalyptic number.
It is an amenable number.
1330211320101 is a deficient number, since it is larger than the sum of its proper divisors (674744872827).
1330211320101 is a wasteful number, since it uses less digits than its factorization.
1330211320101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6426141672 (or 6426141669 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1330211320101 its reverse (1010231120331), we get a palindrome (2340442440432).
The spelling of 1330211320101 in words is "one trillion, three hundred thirty billion, two hundred eleven million, three hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •