Base | Representation |
---|---|
bin | 11000111010101000… |
… | …10001111011000011 |
3 | 1021112020201200111212 |
4 | 30131110101323003 |
5 | 204343422214233 |
6 | 10051210200335 |
7 | 652326363560 |
oct | 143524217303 |
9 | 37466650455 |
10 | 13376757443 |
11 | 5744915945 |
12 | 2713a230ab |
13 | 1352465cba |
14 | 90c7dd867 |
15 | 534573a48 |
hex | 31d511ec3 |
13376757443 has 8 divisors (see below), whose sum is σ = 15439087200. Its totient is φ = 11352268800.
The previous prime is 13376757421. The next prime is 13376757451. The reversal of 13376757443 is 34475767331.
13376757443 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13376757443 - 26 = 13376757379 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13376757391 and 13376757400.
It is not an unprimeable number, because it can be changed into a prime (13376757403) 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 7 ways as a sum of consecutive naturals, for example, 9459518 + ... + 9460931.
It is an arithmetic number, because the mean of its divisors is an integer number (1929885900).
Almost surely, 213376757443 is an apocalyptic number.
13376757443 is a deficient number, since it is larger than the sum of its proper divisors (2062329757).
13376757443 is a wasteful number, since it uses less digits than its factorization.
13376757443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18920557.
The product of its digits is 4445280, while the sum is 50.
The spelling of 13376757443 in words is "thirteen billion, three hundred seventy-six million, seven hundred fifty-seven thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •