Base | Representation |
---|---|
bin | 10011000111110001001… |
… | …010001111101110110111 |
3 | 11122121200200120000200210 |
4 | 103013301022033232313 |
5 | 133012043310121330 |
6 | 2443352012240503 |
7 | 163635263245665 |
oct | 23076112175667 |
9 | 4577620500623 |
10 | 1314011020215 |
11 | 4672a5a68043 |
12 | 1927b7770133 |
13 | 96baba9434a |
14 | 478542cdc35 |
15 | 242a8ed38b0 |
hex | 131f128fbb7 |
1314011020215 has 192 divisors, whose sum is σ = 2398634127360. Its totient is φ = 612750458880.
The previous prime is 1314011020199. The next prime is 1314011020243. The reversal of 1314011020215 is 5120201104131.
It is not a de Polignac number, because 1314011020215 - 24 = 1314011020199 is a prime.
It is a super-2 number, since 2×13140110202152 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1314011020191 and 1314011020200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 752151972 + ... + 752153718.
It is an arithmetic number, because the mean of its divisors is an integer number (12492886080).
Almost surely, 21314011020215 is an apocalyptic number.
1314011020215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1314011020215 is a deficient number, since it is larger than the sum of its proper divisors (1084623107145).
1314011020215 is a wasteful number, since it uses less digits than its factorization.
1314011020215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2042 (or 2025 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 21.
Adding to 1314011020215 its reverse (5120201104131), we get a palindrome (6434212124346).
The spelling of 1314011020215 in words is "one trillion, three hundred fourteen billion, eleven million, twenty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •