Base | Representation |
---|---|
bin | 100111111100000… |
… | …0111101000111111 |
3 | 10110101122201021102 |
4 | 1033320013220333 |
5 | 10221032031143 |
6 | 340551123315 |
7 | 45131521250 |
oct | 11770075077 |
9 | 3411581242 |
10 | 1340111423 |
11 | 628504602 |
12 | 31497353b |
13 | 184840451 |
14 | c9da2b27 |
15 | 7c9b50b8 |
hex | 4fe07a3f |
1340111423 has 8 divisors (see below), whose sum is σ = 1564142592. Its totient is φ = 1124226936.
The previous prime is 1340111419. The next prime is 1340111447. The reversal of 1340111423 is 3241110431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1340111423 - 22 = 1340111419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1340111395 and 1340111404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340111453) 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, 2036315 + ... + 2036972.
It is an arithmetic number, because the mean of its divisors is an integer number (195517824).
Almost surely, 21340111423 is an apocalyptic number.
1340111423 is a deficient number, since it is larger than the sum of its proper divisors (224031169).
1340111423 is an equidigital number, since it uses as much as digits as its factorization.
1340111423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4073341.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 1340111423 is about 36607.5323260118. The cubic root of 1340111423 is about 1102.5043280493.
Adding to 1340111423 its reverse (3241110431), we get a palindrome (4581221854).
The spelling of 1340111423 in words is "one billion, three hundred forty million, one hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •