Base | Representation |
---|---|
bin | 10011001000011100100… |
… | …111111000101101000110 |
3 | 11122200120111122201201110 |
4 | 103020130213320231012 |
5 | 133020041443214002 |
6 | 2443552221305450 |
7 | 163662326254125 |
oct | 23103447705506 |
9 | 4580514581643 |
10 | 1314740210502 |
11 | 46763a634544 |
12 | 19297ba05286 |
13 | 96c96b83ca4 |
14 | 478c30a5abc |
15 | 242ed01ee6c |
hex | 1321c9f8b46 |
1314740210502 has 8 divisors (see below), whose sum is σ = 2629480421016. Its totient is φ = 438246736832.
The previous prime is 1314740210423. The next prime is 1314740210549. The reversal of 1314740210502 is 2050120474131.
It is a sphenic number, since it is the product of 3 distinct primes.
1314740210502 is an admirable number.
It is a super-2 number, since 2×13147402105022 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1314740210502.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 109561684203 + ... + 109561684214.
It is an arithmetic number, because the mean of its divisors is an integer number (328685052627).
Almost surely, 21314740210502 is an apocalyptic number.
1314740210502 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1314740210502 is a wasteful number, since it uses less digits than its factorization.
1314740210502 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219123368422.
The product of its (nonzero) digits is 6720, while the sum is 30.
Adding to 1314740210502 its reverse (2050120474131), we get a palindrome (3364860684633).
The spelling of 1314740210502 in words is "one trillion, three hundred fourteen billion, seven hundred forty million, two hundred ten thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •