Base | Representation |
---|---|
bin | 10011000111110111010… |
… | …000100000100000101111 |
3 | 11122121221211001122121201 |
4 | 103013313100200200233 |
5 | 133012301002400403 |
6 | 2443410105110331 |
7 | 163640644650655 |
oct | 23076720404057 |
9 | 4577854048551 |
10 | 1314113325103 |
11 | 467348793237 |
12 | 192825a883a7 |
13 | 96bc7033c97 |
14 | 47863b20dd5 |
15 | 242b2e9121d |
hex | 131f742082f |
1314113325103 has 4 divisors (see below), whose sum is σ = 1371248687088. Its totient is φ = 1256977963120.
The previous prime is 1314113325101. The next prime is 1314113325137. The reversal of 1314113325103 is 3015233114131.
It is a happy number.
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 1314113325103 - 21 = 1314113325101 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 (1314113325101) 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, 28567680958 + ... + 28567681003.
It is an arithmetic number, because the mean of its divisors is an integer number (342812171772).
Almost surely, 21314113325103 is an apocalyptic number.
1314113325103 is a deficient number, since it is larger than the sum of its proper divisors (57135361985).
1314113325103 is an equidigital number, since it uses as much as digits as its factorization.
1314113325103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57135361984.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 1314113325103 its reverse (3015233114131), we get a palindrome (4329346439234).
The spelling of 1314113325103 in words is "one trillion, three hundred fourteen billion, one hundred thirteen million, three hundred twenty-five thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •