Base | Representation |
---|---|
bin | 1100011010101010000011… |
… | …1001001110110100100011 |
3 | 1210100010110200220101101021 |
4 | 3012222200321032310203 |
5 | 3242134002442033123 |
6 | 45011405102550311 |
7 | 2606221620300133 |
oct | 306524071166443 |
9 | 53303420811337 |
10 | 13652105424163 |
11 | 4393909669708 |
12 | 1645a52598397 |
13 | 78050762234b |
14 | 352aa0498ac3 |
15 | 18a1c8b33c5d |
hex | c6aa0e4ed23 |
13652105424163 has 4 divisors (see below), whose sum is σ = 13735860672328. Its totient is φ = 13568350176000.
The previous prime is 13652105424161. The next prime is 13652105424211. The reversal of 13652105424163 is 36142450125631.
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 13652105424163 - 21 = 13652105424161 is a prime.
It is a super-2 number, since 2×136521054241632 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13652105424161) 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, 41877623838 + ... + 41877624163.
It is an arithmetic number, because the mean of its divisors is an integer number (3433965168082).
Almost surely, 213652105424163 is an apocalyptic number.
13652105424163 is a deficient number, since it is larger than the sum of its proper divisors (83755248165).
13652105424163 is an equidigital number, since it uses as much as digits as its factorization.
13652105424163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83755248164.
The product of its (nonzero) digits is 518400, while the sum is 43.
Adding to 13652105424163 its reverse (36142450125631), we get a palindrome (49794555549794).
The spelling of 13652105424163 in words is "thirteen trillion, six hundred fifty-two billion, one hundred five million, four hundred twenty-four thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •