Base | Representation |
---|---|
bin | 101000000001001… |
… | …1011000100100101 |
3 | 10110120201221101120 |
4 | 1100002123010211 |
5 | 10222224444303 |
6 | 341125044153 |
7 | 45163501053 |
oct | 12002330445 |
9 | 3416657346 |
10 | 1342812453 |
11 | 629a89964 |
12 | 315856659 |
13 | 1852779a8 |
14 | ca4a71d3 |
15 | 7cd4a553 |
hex | 5009b125 |
1342812453 has 4 divisors (see below), whose sum is σ = 1790416608. Its totient is φ = 895208300.
The previous prime is 1342812451. The next prime is 1342812481. The reversal of 1342812453 is 3542182431.
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 1342812453 - 21 = 1342812451 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1342812451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 223802073 + ... + 223802078.
It is an arithmetic number, because the mean of its divisors is an integer number (447604152).
Almost surely, 21342812453 is an apocalyptic number.
It is an amenable number.
1342812453 is a deficient number, since it is larger than the sum of its proper divisors (447604155).
1342812453 is an equidigital number, since it uses as much as digits as its factorization.
1342812453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447604154.
The product of its digits is 23040, while the sum is 33.
The square root of 1342812453 is about 36644.4054802367. The cubic root of 1342812453 is about 1103.2445398393.
Adding to 1342812453 its reverse (3542182431), we get a palindrome (4884994884).
The spelling of 1342812453 in words is "one billion, three hundred forty-two million, eight hundred twelve thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •