Base | Representation |
---|---|
bin | 1100011000000011100110… |
… | …0011110001110111110011 |
3 | 1210011212010122022000201111 |
4 | 3012000321203301313303 |
5 | 3240421000022334410 |
6 | 44535055143414151 |
7 | 2603050414136224 |
oct | 306007143616763 |
9 | 53155118260644 |
10 | 13607422074355 |
11 | 437696a01a63a |
12 | 1639262154357 |
13 | 7792361bb7a5 |
14 | 350861cd524b |
15 | 188e60de2b8a |
hex | c60398f1df3 |
13607422074355 has 4 divisors (see below), whose sum is σ = 16328906489232. Its totient is φ = 10885937659480.
The previous prime is 13607422074349. The next prime is 13607422074391. The reversal of 13607422074355 is 55347022470631.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13607422074355 - 27 = 13607422074227 is a prime.
It is a super-2 number, since 2×136074220743552 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13607422074299 and 13607422074308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1360742207431 + ... + 1360742207440.
It is an arithmetic number, because the mean of its divisors is an integer number (4082226622308).
Almost surely, 213607422074355 is an apocalyptic number.
13607422074355 is a deficient number, since it is larger than the sum of its proper divisors (2721484414877).
13607422074355 is an equidigital number, since it uses as much as digits as its factorization.
13607422074355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2721484414876.
The product of its (nonzero) digits is 4233600, while the sum is 49.
The spelling of 13607422074355 in words is "thirteen trillion, six hundred seven billion, four hundred twenty-two million, seventy-four thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •