Base | Representation |
---|---|
bin | 1011111100110111100110… |
… | …0110101110111011110111 |
3 | 1201112012112020200010010000 |
4 | 2333031321212232323313 |
5 | 3210242411324432234 |
6 | 43540331412202343 |
7 | 2524234000626414 |
oct | 277157146567367 |
9 | 51465466603100 |
10 | 13140345155319 |
11 | 42068752aa168 |
12 | 158282b0093b3 |
13 | 74418abc8415 |
14 | 335dd341d10b |
15 | 17bc25836899 |
hex | bf3799aeef7 |
13140345155319 has 20 divisors (see below), whose sum is σ = 19922380685944. Its totient is φ = 8629480396944.
The previous prime is 13140345155297. The next prime is 13140345155321. The reversal of 13140345155319 is 91355154304131.
It is a happy number.
13140345155319 is a `hidden beast` number, since 1 + 3 + 1 + 4 + 0 + 34 + 51 + 553 + 19 = 666.
It is not a de Polignac number, because 13140345155319 - 225 = 13140311600887 is a prime.
It is a super-2 number, since 2×131403451553192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13140345165319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1210639972 + ... + 1210650825.
Almost surely, 213140345155319 is an apocalyptic number.
13140345155319 is a deficient number, since it is larger than the sum of its proper divisors (6782035530625).
13140345155319 is an equidigital number, since it uses as much as digits as its factorization.
13140345155319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2421290876 (or 2421290867 counting only the distinct ones).
The product of its (nonzero) digits is 486000, while the sum is 45.
The spelling of 13140345155319 in words is "thirteen trillion, one hundred forty billion, three hundred forty-five million, one hundred fifty-five thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •