Base | Representation |
---|---|
bin | 10011000110111010111… |
… | …100000011011100100011 |
3 | 11122112100021210222121102 |
4 | 103012322330003130203 |
5 | 133003212420031321 |
6 | 2443121434345015 |
7 | 163603606101356 |
oct | 23067274033443 |
9 | 4575307728542 |
10 | 1313101330211 |
11 | 466979517520 |
12 | 1925a2b8b16b |
13 | 96a95487238 |
14 | 477a957029d |
15 | 242541e0c0b |
hex | 131baf03723 |
1313101330211 has 8 divisors (see below), whose sum is σ = 1432529625648. Its totient is φ = 1193682276000.
The previous prime is 1313101330199. The next prime is 1313101330249. The reversal of 1313101330211 is 1120331013131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1313101330211 - 214 = 1313101313827 is a prime.
It is a super-2 number, since 2×13131013302112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1313101333211) 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, 2011520 + ... + 2583101.
It is an arithmetic number, because the mean of its divisors is an integer number (179066203206).
Almost surely, 21313101330211 is an apocalyptic number.
1313101330211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1313101330211 is a deficient number, since it is larger than the sum of its proper divisors (119428295437).
1313101330211 is a wasteful number, since it uses less digits than its factorization.
1313101330211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4620613.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1313101330211 its reverse (1120331013131), we get a palindrome (2433432343342).
The spelling of 1313101330211 in words is "one trillion, three hundred thirteen billion, one hundred one million, three hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •