Base | Representation |
---|---|
bin | 1100000111010101010010… |
… | …0010110111010001010011 |
3 | 1202011101112111201112112211 |
4 | 3001311110202313101103 |
5 | 3221214042133312243 |
6 | 44155101443532551 |
7 | 2543226535654456 |
oct | 301652442672123 |
9 | 52141474645484 |
10 | 13320112010323 |
11 | 4276033a80028 |
12 | 15b163a68a157 |
13 | 75810944c041 |
14 | 3409a828949d |
15 | 181747839d9d |
hex | c1d548b7453 |
13320112010323 has 4 divisors (see below), whose sum is σ = 13507719221808. Its totient is φ = 13132504798840.
The previous prime is 13320112010297. The next prime is 13320112010327. The reversal of 13320112010323 is 32301021102331.
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 13320112010323 - 217 = 13320111879251 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13320112010294 and 13320112010303.
It is not an unprimeable number, because it can be changed into a prime (13320112010327) 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, 93803605636 + ... + 93803605777.
It is an arithmetic number, because the mean of its divisors is an integer number (3376929805452).
Almost surely, 213320112010323 is an apocalyptic number.
13320112010323 is a deficient number, since it is larger than the sum of its proper divisors (187607211485).
13320112010323 is an equidigital number, since it uses as much as digits as its factorization.
13320112010323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187607211484.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13320112010323 its reverse (32301021102331), we get a palindrome (45621133112654).
The spelling of 13320112010323 in words is "thirteen trillion, three hundred twenty billion, one hundred twelve million, ten thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •