Base | Representation |
---|---|
bin | 11110100011001110111101… |
… | …101111010101110010101101 |
3 | 122121201221110202200011012120 |
4 | 132203032331233111302231 |
5 | 120102344144134141441 |
6 | 1153433202545423153 |
7 | 40205244414234132 |
oct | 3643167557256255 |
9 | 577657422604176 |
10 | 134362645224621 |
11 | 398a2972447600 |
12 | 130a046a03aab9 |
13 | 59c845c985268 |
14 | 2527288548589 |
15 | 10801327ca966 |
hex | 7a33bdbd5cad |
134362645224621 has 48 divisors (see below), whose sum is σ = 208506869311104. Its totient is φ = 76639459072000.
The previous prime is 134362645224539. The next prime is 134362645224637. The reversal of 134362645224621 is 126422546263431.
It is not a de Polignac number, because 134362645224621 - 229 = 134362108353709 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134362645224671) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 213393541 + ... + 214022261.
It is an arithmetic number, because the mean of its divisors is an integer number (4343893110648).
Almost surely, 2134362645224621 is an apocalyptic number.
134362645224621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134362645224621 is a deficient number, since it is larger than the sum of its proper divisors (74144224086483).
134362645224621 is a wasteful number, since it uses less digits than its factorization.
134362645224621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 663394 (or 663383 counting only the distinct ones).
The product of its digits is 9953280, while the sum is 51.
The spelling of 134362645224621 in words is "one hundred thirty-four trillion, three hundred sixty-two billion, six hundred forty-five million, two hundred twenty-four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •