Base | Representation |
---|---|
bin | 1100000111111010100111… |
… | …0101111010101101110011 |
3 | 1202012100101212222201101022 |
4 | 3001332221311322231303 |
5 | 3221400103022044443 |
6 | 44203440100330055 |
7 | 2544033060002066 |
oct | 301765165725563 |
9 | 52170355881338 |
10 | 13330133003123 |
11 | 427a306623262 |
12 | 15b35766a392b |
13 | 7590455a9791 |
14 | 3412791148dd |
15 | 181b32492e68 |
hex | c1fa9d7ab73 |
13330133003123 has 8 divisors (see below), whose sum is σ = 13548725452560. Its totient is φ = 13111542672480.
The previous prime is 13330133003119. The next prime is 13330133003129. The reversal of 13330133003123 is 32130033103331.
It is a happy number.
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 13330133003123 - 22 = 13330133003119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13330133003092 and 13330133003101.
It is not an unprimeable number, because it can be changed into a prime (13330133003129) 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, 16728893 + ... + 17507601.
It is an arithmetic number, because the mean of its divisors is an integer number (1693590681570).
Almost surely, 213330133003123 is an apocalyptic number.
13330133003123 is a deficient number, since it is larger than the sum of its proper divisors (218592449437).
13330133003123 is an equidigital number, since it uses as much as digits as its factorization.
13330133003123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1059397.
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 13330133003123 its reverse (32130033103331), we get a palindrome (45460166106454).
The spelling of 13330133003123 in words is "thirteen trillion, three hundred thirty billion, one hundred thirty-three million, three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •