Base | Representation |
---|---|
bin | 11000011110101001… |
… | …10011000111110011 |
3 | 1020220220000101212010 |
4 | 30033110303013303 |
5 | 203403323344103 |
6 | 10012022534003 |
7 | 643446155652 |
oct | 141724630763 |
9 | 36826011763 |
10 | 13142012403 |
11 | 5634361483 |
12 | 2669297303 |
13 | 1315935000 |
14 | 8c9575199 |
15 | 51db54903 |
hex | 30f5331f3 |
13142012403 has 16 divisors (see below), whose sum is σ = 18982251680. Its totient is φ = 8087388192.
The previous prime is 13142012399. The next prime is 13142012419. The reversal of 13142012403 is 30421024131.
It is not a de Polignac number, because 13142012403 - 22 = 13142012399 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13142012403.
It is not an unprimeable number, because it can be changed into a prime (13142012483) 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 15 ways as a sum of consecutive naturals, for example, 990376 + ... + 1003557.
It is an arithmetic number, because the mean of its divisors is an integer number (1186390730).
Almost surely, 213142012403 is an apocalyptic number.
13142012403 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13142012403 is a deficient number, since it is larger than the sum of its proper divisors (5840239277).
13142012403 is an equidigital number, since it uses as much as digits as its factorization.
13142012403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1993975 (or 1993949 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 13142012403 its reverse (30421024131), we get a palindrome (43563036534).
The spelling of 13142012403 in words is "thirteen billion, one hundred forty-two million, twelve thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •