Base | Representation |
---|---|
bin | 1100000000011110100001… |
… | …0100111011111100010011 |
3 | 1201202010112020102111012001 |
4 | 3000013220110323330103 |
5 | 3212301334032144443 |
6 | 44025022344014431 |
7 | 2531560046660065 |
oct | 300075024737423 |
9 | 51663466374161 |
10 | 13202332303123 |
11 | 4230094445837 |
12 | 159284a461417 |
13 | 749c8924cac2 |
14 | 338dd3b83735 |
15 | 17d65275dd4d |
hex | c01e853bf13 |
13202332303123 has 8 divisors (see below), whose sum is σ = 13223284588800. Its totient is φ = 13181384299200.
The previous prime is 13202332303079. The next prime is 13202332303141. The reversal of 13202332303123 is 32130323320231.
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 13202332303123 - 241 = 11003309047571 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13202332303091 and 13202332303100.
It is not an unprimeable number, because it can be changed into a prime (13202332303183) 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, 5129703 + ... + 7260751.
It is an arithmetic number, because the mean of its divisors is an integer number (1652910573600).
Almost surely, 213202332303123 is an apocalyptic number.
13202332303123 is a deficient number, since it is larger than the sum of its proper divisors (20952285677).
13202332303123 is an equidigital number, since it uses as much as digits as its factorization.
13202332303123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2140877.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 13202332303123 its reverse (32130323320231), we get a palindrome (45332655623354).
The spelling of 13202332303123 in words is "thirteen trillion, two hundred two billion, three hundred thirty-two million, three hundred three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •