Base | Representation |
---|---|
bin | 111100011101011… |
… | …010100111000011 |
3 | 2121200200000120011 |
4 | 330131122213003 |
5 | 4034133003011 |
6 | 244352525351 |
7 | 34064532343 |
oct | 7435324703 |
9 | 2550600504 |
10 | 1014344131 |
11 | 480630839 |
12 | 243850857 |
13 | 1321c0138 |
14 | 98a02d23 |
15 | 5e0b6621 |
hex | 3c75a9c3 |
1014344131 has 8 divisors (see below), whose sum is σ = 1019548640. Its totient is φ = 1009153728.
The previous prime is 1014344129. The next prime is 1014344167. The reversal of 1014344131 is 1314434101.
It is a happy number.
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 1014344131 - 21 = 1014344129 is a prime.
It is a super-2 number, since 2×10143441312 = 2057788032188290322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1014341131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 159250 + ... + 165496.
It is an arithmetic number, because the mean of its divisors is an integer number (127443580).
Almost surely, 21014344131 is an apocalyptic number.
1014344131 is a deficient number, since it is larger than the sum of its proper divisors (5204509).
1014344131 is an equidigital number, since it uses as much as digits as its factorization.
1014344131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7053.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 1014344131 is about 31848.7696936632. The cubic root of 1014344131 is about 1004.7586958929.
Adding to 1014344131 its reverse (1314434101), we get a palindrome (2328778232).
The spelling of 1014344131 in words is "one billion, fourteen million, three hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •