Base | Representation |
---|---|
bin | 11110100011110110100111… |
… | …011001110011101101101111 |
3 | 122121220000100212220200002002 |
4 | 132203312213121303231233 |
5 | 120104043342324413343 |
6 | 1153504523350122515 |
7 | 40211312436201254 |
oct | 3643664731635557 |
9 | 577800325820062 |
10 | 134405220154223 |
11 | 39909a2a927337 |
12 | 130a877035043b |
13 | 59cc4863404b5 |
14 | 2529366aad42b |
15 | 10812c538e8b8 |
hex | 7a3da7673b6f |
134405220154223 has 16 divisors (see below), whose sum is σ = 135757506044160. Its totient is φ = 133053853474944.
The previous prime is 134405220154217. The next prime is 134405220154279. The reversal of 134405220154223 is 322451022504431.
It is a cyclic number.
It is not a de Polignac number, because 134405220154223 - 228 = 134404951718767 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 (134405220156223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6927023240 + ... + 6927042642.
It is an arithmetic number, because the mean of its divisors is an integer number (8484844127760).
Almost surely, 2134405220154223 is an apocalyptic number.
134405220154223 is a deficient number, since it is larger than the sum of its proper divisors (1352285889937).
134405220154223 is a wasteful number, since it uses less digits than its factorization.
134405220154223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39518.
The product of its (nonzero) digits is 230400, while the sum is 38.
Adding to 134405220154223 its reverse (322451022504431), we get a palindrome (456856242658654).
The spelling of 134405220154223 in words is "one hundred thirty-four trillion, four hundred five billion, two hundred twenty million, one hundred fifty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •