Base | Representation |
---|---|
bin | 1011111011101011100000… |
… | …1001101111000000100011 |
3 | 1201110020210202112112121022 |
4 | 2332322320021233000203 |
5 | 3204424043414302241 |
6 | 43523112523320055 |
7 | 2522611561153313 |
oct | 276727011570043 |
9 | 51406722475538 |
10 | 13119919681571 |
11 | 41a914369644a |
12 | 157a88a68002b |
13 | 742284330491 |
14 | 335016821443 |
15 | 17b42c57454b |
hex | beeb826f023 |
13119919681571 has 2 divisors, whose sum is σ = 13119919681572. Its totient is φ = 13119919681570.
The previous prime is 13119919681559. The next prime is 13119919681577. The reversal of 13119919681571 is 17518691991131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13119919681571 - 26 = 13119919681507 is a prime.
It is not a weakly prime, because it can be changed into another prime (13119919681577) by changing a digit.
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 as a sum of consecutive naturals, namely, 6559959840785 + 6559959840786.
It is an arithmetic number, because the mean of its divisors is an integer number (6559959840786).
Almost surely, 213119919681571 is an apocalyptic number.
13119919681571 is a deficient number, since it is larger than the sum of its proper divisors (1).
13119919681571 is an equidigital number, since it uses as much as digits as its factorization.
13119919681571 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3674160, while the sum is 62.
The spelling of 13119919681571 in words is "thirteen trillion, one hundred nineteen billion, nine hundred nineteen million, six hundred eighty-one thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •