Base | Representation |
---|---|
bin | 1100101001011110010101… |
… | …0111101000101011110011 |
3 | 1211020110111212012021122012 |
4 | 3022113211113220223303 |
5 | 3310321313233044241 |
6 | 45324344041233135 |
7 | 2633502634543256 |
oct | 312274527505363 |
9 | 54213455167565 |
10 | 13906657315571 |
11 | 4481864566289 |
12 | 16872534927ab |
13 | 79b513755cb7 |
14 | 36112b64309d |
15 | 191b2638b6eb |
hex | ca5e55e8af3 |
13906657315571 has 2 divisors, whose sum is σ = 13906657315572. Its totient is φ = 13906657315570.
The previous prime is 13906657315553. The next prime is 13906657315601. The reversal of 13906657315571 is 17551375660931.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13906657315571 - 238 = 13631779408627 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13906657315571.
It is not a weakly prime, because it can be changed into another prime (13906657315171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6953328657785 + 6953328657786.
It is an arithmetic number, because the mean of its divisors is an integer number (6953328657786).
Almost surely, 213906657315571 is an apocalyptic number.
13906657315571 is a deficient number, since it is larger than the sum of its proper divisors (1).
13906657315571 is an equidigital number, since it uses as much as digits as its factorization.
13906657315571 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17860500, while the sum is 59.
The spelling of 13906657315571 in words is "thirteen trillion, nine hundred six billion, six hundred fifty-seven million, three hundred fifteen thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •