Base | Representation |
---|---|
bin | 10011000111111000011… |
… | …011100100111011100011 |
3 | 11122122000012002102222212 |
4 | 103013320123210323203 |
5 | 133012321022112003 |
6 | 2443412050552335 |
7 | 163641304141601 |
oct | 23077033447343 |
9 | 4578005072885 |
10 | 1314133004003 |
11 | 467358904296 |
12 | 1928305986ab |
13 | 96bcb1341c1 |
14 | 478665a4871 |
15 | 242b4a7bdd8 |
hex | 131f86e4ee3 |
1314133004003 has 4 divisors (see below), whose sum is σ = 1314135711648. Its totient is φ = 1314130296360.
The previous prime is 1314133003991. The next prime is 1314133004077. The reversal of 1314133004003 is 3004003314131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1314133004003 - 28 = 1314133003747 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 1314133004003.
It is not an unprimeable number, because it can be changed into a prime (1314133004083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 403403 + ... + 1670628.
It is an arithmetic number, because the mean of its divisors is an integer number (328533927912).
Almost surely, 21314133004003 is an apocalyptic number.
1314133004003 is a deficient number, since it is larger than the sum of its proper divisors (2707645).
1314133004003 is an equidigital number, since it uses as much as digits as its factorization.
1314133004003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2707644.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1314133004003 its reverse (3004003314131), we get a palindrome (4318136318134).
The spelling of 1314133004003 in words is "one trillion, three hundred fourteen billion, one hundred thirty-three million, four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •