Base | Representation |
---|---|
bin | 100111001010100… |
… | …0011100000000111 |
3 | 10101120210100012220 |
4 | 1032111003200013 |
5 | 10142410022330 |
6 | 334222343423 |
7 | 44365011261 |
oct | 11625034007 |
9 | 3346710186 |
10 | 1314142215 |
11 | 614887551 |
12 | 30812ab73 |
13 | 17c34a059 |
14 | c6762b31 |
15 | 7a585710 |
hex | 4e543807 |
1314142215 has 16 divisors (see below), whose sum is σ = 2137098336. Its totient is φ = 689385600.
The previous prime is 1314142213. The next prime is 1314142229. The reversal of 1314142215 is 5122414131.
It is not a de Polignac number, because 1314142215 - 21 = 1314142213 is a prime.
It is a super-2 number, since 2×13141422152 = 3453939522490212450, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314142213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 717196 + ... + 719025.
It is an arithmetic number, because the mean of its divisors is an integer number (133568646).
Almost surely, 21314142215 is an apocalyptic number.
1314142215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1314142215 is a deficient number, since it is larger than the sum of its proper divisors (822956121).
1314142215 is a wasteful number, since it uses less digits than its factorization.
1314142215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1436290.
The product of its digits is 960, while the sum is 24.
The square root of 1314142215 is about 36251.0995005669. The cubic root of 1314142215 is about 1095.3362366856.
Adding to 1314142215 its reverse (5122414131), we get a palindrome (6436556346).
The spelling of 1314142215 in words is "one billion, three hundred fourteen million, one hundred forty-two thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •