Base | Representation |
---|---|
bin | 11000111111011000… |
… | …10010010111010101 |
3 | 1021122000201011021112 |
4 | 30133230102113111 |
5 | 204434122331031 |
6 | 10055152224405 |
7 | 653322155612 |
oct | 143754222725 |
9 | 37560634245 |
10 | 13416605141 |
11 | 5765362025 |
12 | 272523b105 |
13 | 135a7a8414 |
14 | 913c13509 |
15 | 537ce562b |
hex | 31fb125d5 |
13416605141 has 4 divisors (see below), whose sum is σ = 13421297484. Its totient is φ = 13411912800.
The previous prime is 13416605117. The next prime is 13416605159. The reversal of 13416605141 is 14150661431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5173781041 + 8242824100 = 71929^2 + 90790^2 .
It is a cyclic number.
It is not a de Polignac number, because 13416605141 - 218 = 13416342997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13416605098 and 13416605107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13416605171) 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 in 3 ways as a sum of consecutive naturals, for example, 2341880 + ... + 2347601.
It is an arithmetic number, because the mean of its divisors is an integer number (3355324371).
Almost surely, 213416605141 is an apocalyptic number.
It is an amenable number.
13416605141 is a deficient number, since it is larger than the sum of its proper divisors (4692343).
13416605141 is an equidigital number, since it uses as much as digits as its factorization.
13416605141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4692342.
The product of its (nonzero) digits is 8640, while the sum is 32.
The spelling of 13416605141 in words is "thirteen billion, four hundred sixteen million, six hundred five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •