Base | Representation |
---|---|
bin | 100111001010111… |
… | …0011111001001111 |
3 | 10101121011102010020 |
4 | 1032111303321033 |
5 | 10142432343211 |
6 | 334230513223 |
7 | 44366465205 |
oct | 11625637117 |
9 | 3347142106 |
10 | 1314340431 |
11 | 614a02468 |
12 | 308205813 |
13 | 17c3b9341 |
14 | c67b5075 |
15 | 7a5c4306 |
hex | 4e573e4f |
1314340431 has 8 divisors (see below), whose sum is σ = 1855539504. Its totient is φ = 824684160.
The previous prime is 1314340411. The next prime is 1314340439. The reversal of 1314340431 is 1340434131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1314340431 - 26 = 1314340367 is a prime.
It is a super-2 number, since 2×13143404312 = 3454981537122531522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314340439) 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 7 ways as a sum of consecutive naturals, for example, 12885640 + ... + 12885741.
It is an arithmetic number, because the mean of its divisors is an integer number (231942438).
Almost surely, 21314340431 is an apocalyptic number.
1314340431 is a deficient number, since it is larger than the sum of its proper divisors (541199073).
1314340431 is a wasteful number, since it uses less digits than its factorization.
1314340431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25771401.
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 1314340431 is about 36253.8333283530. The cubic root of 1314340431 is about 1095.3913048637.
Adding to 1314340431 its reverse (1340434131), we get a palindrome (2654774562).
The spelling of 1314340431 in words is "one billion, three hundred fourteen million, three hundred forty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •