Base | Representation |
---|---|
bin | 11000110010110100… |
… | …01111111000101101 |
3 | 1021100200101200120122 |
4 | 30121122033320231 |
5 | 204230132304401 |
6 | 10040505254325 |
7 | 650602305314 |
oct | 143132177055 |
9 | 37320350518 |
10 | 13311213101 |
11 | 571091846a |
12 | 26b5a943a5 |
13 | 13419c7574 |
14 | 903c1b27b |
15 | 52d92821b |
hex | 31968fe2d |
13311213101 has 8 divisors (see below), whose sum is σ = 13817376000. Its totient is φ = 12809848320.
The previous prime is 13311213031. The next prime is 13311213169. The reversal of 13311213101 is 10131211331.
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 13311213101 - 222 = 13307018797 is a prime.
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 13311213101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13311216101) 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 7 ways as a sum of consecutive naturals, for example, 1193876 + ... + 1204973.
It is an arithmetic number, because the mean of its divisors is an integer number (1727172000).
Almost surely, 213311213101 is an apocalyptic number.
It is an amenable number.
13311213101 is a deficient number, since it is larger than the sum of its proper divisors (506162899).
13311213101 is a wasteful number, since it uses less digits than its factorization.
13311213101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2399059.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 13311213101 its reverse (10131211331), we get a palindrome (23442424432).
The spelling of 13311213101 in words is "thirteen billion, three hundred eleven million, two hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •