Base | Representation |
---|---|
bin | 1100000110001010011001… |
… | …1011101001100100010111 |
3 | 1202002110122122011010222012 |
4 | 3001202212123221210113 |
5 | 3220401410304430143 |
6 | 44141535105454435 |
7 | 2541615446220050 |
oct | 301424633514427 |
9 | 52073578133865 |
10 | 13300011014423 |
11 | 426855953a321 |
12 | 15a976a94141b |
13 | 756254b72523 |
14 | 33da1c7d3727 |
15 | 180e6ccbe418 |
hex | c18a66e9917 |
13300011014423 has 8 divisors (see below), whose sum is σ = 15235279441920. Its totient is φ = 11373559300440.
The previous prime is 13300011014417. The next prime is 13300011014429. The reversal of 13300011014423 is 32441011000331.
It is an interprime number because it is at equal distance from previous prime (13300011014417) and next prime (13300011014429).
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 13300011014423 - 234 = 13282831145239 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 (13300011014429) 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, 2204175143 + ... + 2204181176.
It is an arithmetic number, because the mean of its divisors is an integer number (1904409930240).
Almost surely, 213300011014423 is an apocalyptic number.
13300011014423 is a deficient number, since it is larger than the sum of its proper divisors (1935268427497).
13300011014423 is an equidigital number, since it uses as much as digits as its factorization.
13300011014423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4408356757.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 13300011014423 its reverse (32441011000331), we get a palindrome (45741022014754).
The spelling of 13300011014423 in words is "thirteen trillion, three hundred billion, eleven million, fourteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •