Base | Representation |
---|---|
bin | 11110100011001110011101… |
… | …100011011010010011010111 |
3 | 122121201220002010120101222111 |
4 | 132203032131203122103113 |
5 | 120102342042414221310 |
6 | 1153433033215411451 |
7 | 40205225136310351 |
oct | 3643163543322327 |
9 | 577656063511874 |
10 | 134362105226455 |
11 | 398a2715650a27 |
12 | 130a0339223b87 |
13 | 59c83a4b37412 |
14 | 25272369400d1 |
15 | 10801001b128a |
hex | 7a339d8da4d7 |
134362105226455 has 16 divisors (see below), whose sum is σ = 170719184844000. Its totient is φ = 101166598812672.
The previous prime is 134362105226449. The next prime is 134362105226501. The reversal of 134362105226455 is 554622501263431.
It is a cyclic number.
It is not a de Polignac number, because 134362105226455 - 219 = 134362104702167 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134362105226399 and 134362105226408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 91156171 + ... + 92618419.
It is an arithmetic number, because the mean of its divisors is an integer number (10669949052750).
Almost surely, 2134362105226455 is an apocalyptic number.
134362105226455 is a deficient number, since it is larger than the sum of its proper divisors (36357079617545).
134362105226455 is a wasteful number, since it uses less digits than its factorization.
134362105226455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2543298.
The product of its (nonzero) digits is 5184000, while the sum is 49.
Adding to 134362105226455 its reverse (554622501263431), we get a palindrome (688984606489886).
The spelling of 134362105226455 in words is "one hundred thirty-four trillion, three hundred sixty-two billion, one hundred five million, two hundred twenty-six thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •