Base | Representation |
---|---|
bin | 1100000111111010111100… |
… | …0001110100111001100111 |
3 | 1202012100121221201011220101 |
4 | 3001332233001310321213 |
5 | 3221400242310323421 |
6 | 44203452445244531 |
7 | 2544035164363513 |
oct | 301765701647147 |
9 | 52170557634811 |
10 | 13330220011111 |
11 | 427a350750693 |
12 | 15b359b863747 |
13 | 75905a6218b3 |
14 | 3412868c3143 |
15 | 181b39e2d191 |
hex | c1faf074e67 |
13330220011111 has 4 divisors (see below), whose sum is σ = 13350633824952. Its totient is φ = 13309806197272.
The previous prime is 13330220011109. The next prime is 13330220011159. The reversal of 13330220011111 is 11111002203331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13330220011111 - 21 = 13330220011109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330220011711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10206905941 + ... + 10206907246.
It is an arithmetic number, because the mean of its divisors is an integer number (3337658456238).
Almost surely, 213330220011111 is an apocalyptic number.
13330220011111 is a deficient number, since it is larger than the sum of its proper divisors (20413813841).
13330220011111 is an equidigital number, since it uses as much as digits as its factorization.
13330220011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20413813840.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13330220011111 its reverse (11111002203331), we get a palindrome (24441222214442).
The spelling of 13330220011111 in words is "thirteen trillion, three hundred thirty billion, two hundred twenty million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •