Base | Representation |
---|---|
bin | 11000011110010010… |
… | …00100110111110001 |
3 | 1020220200020021110100 |
4 | 30033021010313301 |
5 | 203402032030002 |
6 | 10011433023013 |
7 | 643411066464 |
oct | 141711046761 |
9 | 36820207410 |
10 | 13138939377 |
11 | 5632652693 |
12 | 2668254a69 |
13 | 13150ca355 |
14 | 8c8db52db |
15 | 51d74911c |
hex | 30f244df1 |
13138939377 has 6 divisors (see below), whose sum is σ = 18978468002. Its totient is φ = 8759292912.
The previous prime is 13138939361. The next prime is 13138939421. The reversal of 13138939377 is 77393983131.
It is a happy number.
13138939377 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 12865003776 + 273935601 = 113424^2 + 16551^2 .
It is not a de Polignac number, because 13138939377 - 24 = 13138939361 is a prime.
It is a super-2 number, since 2×131389393772 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13138939327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 729941068 + ... + 729941085.
Almost surely, 213138939377 is an apocalyptic number.
It is an amenable number.
13138939377 is a deficient number, since it is larger than the sum of its proper divisors (5839528625).
13138939377 is a wasteful number, since it uses less digits than its factorization.
13138939377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1459882159 (or 1459882156 counting only the distinct ones).
The product of its digits is 2571912, while the sum is 54.
The spelling of 13138939377 in words is "thirteen billion, one hundred thirty-eight million, nine hundred thirty-nine thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •