Base | Representation |
---|---|
bin | 100111001010010… |
… | …1101110100110111 |
3 | 10101120121211102121 |
4 | 1032110231310313 |
5 | 10142344202211 |
6 | 334220420411 |
7 | 44364161365 |
oct | 11624556467 |
9 | 3346554377 |
10 | 1314053431 |
11 | 614826879 |
12 | 3080a7707 |
13 | 17c318812 |
14 | c673c635 |
15 | 7a569271 |
hex | 4e52dd37 |
1314053431 has 8 divisors (see below), whose sum is σ = 1322335040. Its totient is φ = 1305787392.
The previous prime is 1314053417. The next prime is 1314053441. The reversal of 1314053431 is 1343504131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1314053431 - 215 = 1314020663 is a prime.
It is a super-2 number, since 2×13140534312 = 3453472839045743522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1314053396 and 1314053405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314053441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 197251 + ... + 203803.
It is an arithmetic number, because the mean of its divisors is an integer number (165291880).
Almost surely, 21314053431 is an apocalyptic number.
1314053431 is a deficient number, since it is larger than the sum of its proper divisors (8281609).
1314053431 is a wasteful number, since it uses less digits than its factorization.
1314053431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7785.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 1314053431 is about 36249.8749101290. The cubic root of 1314053431 is about 1095.3115690047.
Adding to 1314053431 its reverse (1343504131), we get a palindrome (2657557562).
The spelling of 1314053431 in words is "one billion, three hundred fourteen million, fifty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •