Base | Representation |
---|---|
bin | 1100000110001011011110… |
… | …1010000010111101010111 |
3 | 1202002111101202221012011212 |
4 | 3001202313222002331113 |
5 | 3220403003300013421 |
6 | 44142023511452035 |
7 | 2541625555446614 |
oct | 301426752027527 |
9 | 52074352835155 |
10 | 13300300001111 |
11 | 42686976812a2 |
12 | 15a982b68701b |
13 | 75629c9b5476 |
14 | 33da48d3b50b |
15 | 180e88354e5b |
hex | c18b7a82f57 |
13300300001111 has 4 divisors (see below), whose sum is σ = 13388381458224. Its totient is φ = 13212218544000.
The previous prime is 13300300001099. The next prime is 13300300001137. The reversal of 13300300001111 is 11110000300331.
It is a happy number.
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 13300300001111 - 234 = 13283120131927 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 (13300300001011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44040728330 + ... + 44040728631.
It is an arithmetic number, because the mean of its divisors is an integer number (3347095364556).
Almost surely, 213300300001111 is an apocalyptic number.
13300300001111 is a deficient number, since it is larger than the sum of its proper divisors (88081457113).
13300300001111 is an equidigital number, since it uses as much as digits as its factorization.
13300300001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88081457112.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 13300300001111 its reverse (11110000300331), we get a palindrome (24410300301442).
The spelling of 13300300001111 in words is "thirteen trillion, three hundred billion, three hundred million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •