Base | Representation |
---|---|
bin | 11000011011111101… |
… | …10100100011100101 |
3 | 1020212022121022211111 |
4 | 30031332310203211 |
5 | 203332041131033 |
6 | 10005455505021 |
7 | 643053455011 |
oct | 141576644345 |
9 | 36768538744 |
10 | 13119473893 |
11 | 5622667a09 |
12 | 2661828171 |
13 | 1311073306 |
14 | 8c6589541 |
15 | 51bba17cd |
hex | 30dfb48e5 |
13119473893 has 2 divisors, whose sum is σ = 13119473894. Its totient is φ = 13119473892.
The previous prime is 13119473863. The next prime is 13119473977. The reversal of 13119473893 is 39837491131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9976413924 + 3143059969 = 99882^2 + 56063^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13119473893 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13119473863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6559736946 + 6559736947.
It is an arithmetic number, because the mean of its divisors is an integer number (6559736947).
Almost surely, 213119473893 is an apocalyptic number.
It is an amenable number.
13119473893 is a deficient number, since it is larger than the sum of its proper divisors (1).
13119473893 is an equidigital number, since it uses as much as digits as its factorization.
13119473893 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 489888, while the sum is 49.
The spelling of 13119473893 in words is "thirteen billion, one hundred nineteen million, four hundred seventy-three thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •