Base | Representation |
---|---|
bin | 11010010100101011… |
… | …01111011111010101 |
3 | 1100110220001211211222 |
4 | 31022111233133111 |
5 | 212420310143123 |
6 | 10254152140125 |
7 | 1010130666443 |
oct | 151225573725 |
9 | 40426054758 |
10 | 14132115413 |
11 | 5aa2235529 |
12 | 28a4997645 |
13 | 1442ab8490 |
14 | 980c67b93 |
15 | 57aa2d6c8 |
hex | 34a56f7d5 |
14132115413 has 4 divisors (see below), whose sum is σ = 15219201228. Its totient is φ = 13045029600.
The previous prime is 14132115341. The next prime is 14132115443. The reversal of 14132115413 is 31451123141.
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 9443563684 + 4688551729 = 97178^2 + 68473^2 .
It is a cyclic number.
It is not a de Polignac number, because 14132115413 - 212 = 14132111317 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14132115443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 543542888 + ... + 543542913.
It is an arithmetic number, because the mean of its divisors is an integer number (3804800307).
Almost surely, 214132115413 is an apocalyptic number.
14132115413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
14132115413 is a deficient number, since it is larger than the sum of its proper divisors (1087085815).
14132115413 is a wasteful number, since it uses less digits than its factorization.
14132115413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087085814.
The product of its digits is 1440, while the sum is 26.
Adding to 14132115413 its reverse (31451123141), we get a palindrome (45583238554).
The spelling of 14132115413 in words is "fourteen billion, one hundred thirty-two million, one hundred fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •