Base | Representation |
---|---|
bin | 100111111100000… |
… | …1010110001000111 |
3 | 10110101200100211210 |
4 | 1033320022301013 |
5 | 10221032433411 |
6 | 340551302503 |
7 | 45131603505 |
oct | 11770126107 |
9 | 3411610753 |
10 | 1340124231 |
11 | 628513196 |
12 | 31497aa33 |
13 | 184846224 |
14 | c9da7675 |
15 | 7c9b8ca6 |
hex | 4fe0ac47 |
1340124231 has 8 divisors (see below), whose sum is σ = 1787221504. Its totient is φ = 893221560.
The previous prime is 1340124199. The next prime is 1340124241. The reversal of 1340124231 is 1324210431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1340124231 - 25 = 1340124199 is a prime.
It is a super-2 number, since 2×13401242312 = 3591865909026682722, 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 = 1340124198 and 1340124207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340124241) 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, 31741 + ... + 60726.
It is an arithmetic number, because the mean of its divisors is an integer number (223402688).
Almost surely, 21340124231 is an apocalyptic number.
1340124231 is a deficient number, since it is larger than the sum of its proper divisors (447097273).
1340124231 is an equidigital number, since it uses as much as digits as its factorization.
1340124231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97301.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1340124231 is about 36607.7072622692. The cubic root of 1340124231 is about 1102.5078404017.
Adding to 1340124231 its reverse (1324210431), we get a palindrome (2664334662).
The spelling of 1340124231 in words is "one billion, three hundred forty million, one hundred twenty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •