Base | Representation |
---|---|
bin | 1100000000011110001000… |
… | …1111100110111100110011 |
3 | 1201202010021010101022012001 |
4 | 3000013202033212330303 |
5 | 3212301131420234443 |
6 | 44025004300314431 |
7 | 2531554400325055 |
oct | 300074217467463 |
9 | 51663233338161 |
10 | 13202230243123 |
11 | 4230041877629 |
12 | 1592820242a17 |
13 | 749c7106777c |
14 | 338dc43b78d5 |
15 | 17d6487edd4d |
hex | c01e23e6f33 |
13202230243123 has 2 divisors, whose sum is σ = 13202230243124. Its totient is φ = 13202230243122.
The previous prime is 13202230243079. The next prime is 13202230243183. The reversal of 13202230243123 is 32134203220231.
13202230243123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13202230243123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13202230243091 and 13202230243100.
It is not a weakly prime, because it can be changed into another prime (13202230243183) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6601115121561 + 6601115121562.
It is an arithmetic number, because the mean of its divisors is an integer number (6601115121562).
Almost surely, 213202230243123 is an apocalyptic number.
13202230243123 is a deficient number, since it is larger than the sum of its proper divisors (1).
13202230243123 is an equidigital number, since it uses as much as digits as its factorization.
13202230243123 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 13202230243123 its reverse (32134203220231), we get a palindrome (45336433463354).
The spelling of 13202230243123 in words is "thirteen trillion, two hundred two billion, two hundred thirty million, two hundred forty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •