Base | Representation |
---|---|
bin | 111110101011101100… |
… | …0011010001000010101 |
3 | 110212110012110122010102 |
4 | 1331113120122020111 |
5 | 4201140130034303 |
6 | 141501115303445 |
7 | 12503522066513 |
oct | 1752730321025 |
9 | 425405418112 |
10 | 134610002453 |
11 | 520a6923213 |
12 | 2210874ab85 |
13 | c902cb4834 |
14 | 672d84b4b3 |
15 | 377c930288 |
hex | 1f5761a215 |
134610002453 has 4 divisors (see below), whose sum is σ = 134740566048. Its totient is φ = 134479438860.
The previous prime is 134610002447. The next prime is 134610002479. The reversal of 134610002453 is 354200016431.
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 134610002453 - 210 = 134610001429 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134610002953) 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, 65280251 + ... + 65282312.
It is an arithmetic number, because the mean of its divisors is an integer number (33685141512).
Almost surely, 2134610002453 is an apocalyptic number.
It is an amenable number.
134610002453 is a deficient number, since it is larger than the sum of its proper divisors (130563595).
134610002453 is a wasteful number, since it uses less digits than its factorization.
134610002453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130563594.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 134610002453 its reverse (354200016431), we get a palindrome (488810018884).
The spelling of 134610002453 in words is "one hundred thirty-four billion, six hundred ten million, two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •