Base | Representation |
---|---|
bin | 1100000110001011011110… |
… | …1101111100011110000111 |
3 | 1202002111101211212010002201 |
4 | 3001202313231330132013 |
5 | 3220403004030214421 |
6 | 44142023545415331 |
7 | 2541625600234324 |
oct | 301426755743607 |
9 | 52074354763081 |
10 | 13300301023111 |
11 | 426869820a123 |
12 | 15a982ba9a547 |
13 | 75629cc826bb |
14 | 33da49125b4b |
15 | 180e884a7b91 |
hex | c18b7b7c787 |
13300301023111 has 8 divisors (see below), whose sum is σ = 13379153800320. Its totient is φ = 13221672579192.
The previous prime is 13300301023049. The next prime is 13300301023193. The reversal of 13300301023111 is 11132010300331.
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 13300301023111 - 237 = 13162862069639 is a prime.
It is a super-2 number, since 2×133003010231112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300301023411) 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, 55964395 + ... + 56201548.
It is an arithmetic number, because the mean of its divisors is an integer number (1672394225040).
Almost surely, 213300301023111 is an apocalyptic number.
13300301023111 is a deficient number, since it is larger than the sum of its proper divisors (78852777209).
13300301023111 is a wasteful number, since it uses less digits than its factorization.
13300301023111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112166645.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13300301023111 its reverse (11132010300331), we get a palindrome (24432311323442).
The spelling of 13300301023111 in words is "thirteen trillion, three hundred billion, three hundred one million, twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •