Base | Representation |
---|---|
bin | 100111111100101… |
… | …0011011110100101 |
3 | 10110102020111101020 |
4 | 1033321103132211 |
5 | 10221122001203 |
6 | 341001521353 |
7 | 45134254005 |
oct | 11771233645 |
9 | 3412214336 |
10 | 1340422053 |
11 | 6286a6a23 |
12 | 314aa3259 |
13 | 18491b959 |
14 | ca044005 |
15 | 7ca27153 |
hex | 4fe537a5 |
1340422053 has 4 divisors (see below), whose sum is σ = 1787229408. Its totient is φ = 893614700.
The previous prime is 1340422049. The next prime is 1340422067. The reversal of 1340422053 is 3502240431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1340422053 - 22 = 1340422049 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340422753) 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 3 ways as a sum of consecutive naturals, for example, 223403673 + ... + 223403678.
It is an arithmetic number, because the mean of its divisors is an integer number (446807352).
Almost surely, 21340422053 is an apocalyptic number.
It is an amenable number.
1340422053 is a deficient number, since it is larger than the sum of its proper divisors (446807355).
1340422053 is an equidigital number, since it uses as much as digits as its factorization.
1340422053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 446807354.
The product of its (nonzero) digits is 2880, while the sum is 24.
The square root of 1340422053 is about 36611.7747862624. The cubic root of 1340422053 is about 1102.5895061562.
Adding to 1340422053 its reverse (3502240431), we get a palindrome (4842662484).
The spelling of 1340422053 in words is "one billion, three hundred forty million, four hundred twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •