Base | Representation |
---|---|
bin | 1100011011100101110001… |
… | …1101011001101100010101 |
3 | 1210101122211222102021221120 |
4 | 3012321130131121230111 |
5 | 3242414321102202112 |
6 | 45023015554234153 |
7 | 2610330115553253 |
oct | 306713435315425 |
9 | 53348758367846 |
10 | 13668137147157 |
11 | 439a696101459 |
12 | 1648b87585959 |
13 | 781b90b3487c |
14 | 3537817275d3 |
15 | 18a8162e3e8c |
hex | c6e5c759b15 |
13668137147157 has 4 divisors (see below), whose sum is σ = 18224182862880. Its totient is φ = 9112091431436.
The previous prime is 13668137147141. The next prime is 13668137147167. The reversal of 13668137147157 is 75174173186631.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13668137147157 - 24 = 13668137147141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13668137147157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13668137147167) 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, 2278022857857 + ... + 2278022857862.
It is an arithmetic number, because the mean of its divisors is an integer number (4556045715720).
Almost surely, 213668137147157 is an apocalyptic number.
It is an amenable number.
13668137147157 is a deficient number, since it is larger than the sum of its proper divisors (4556045715723).
13668137147157 is an equidigital number, since it uses as much as digits as its factorization.
13668137147157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4556045715722.
The product of its digits is 17781120, while the sum is 60.
The spelling of 13668137147157 in words is "thirteen trillion, six hundred sixty-eight billion, one hundred thirty-seven million, one hundred forty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •