Base | Representation |
---|---|
bin | 111110011100100000… |
… | …0100101110001101111 |
3 | 110211010200122021220022 |
4 | 1330321000211301233 |
5 | 4144114203122343 |
6 | 141334353512355 |
7 | 12455063644256 |
oct | 1747100456157 |
9 | 424120567808 |
10 | 134100442223 |
11 | 51965227060 |
12 | 21ba5b726bb |
13 | c8515630c7 |
14 | 66c1cc779d |
15 | 374cd29568 |
hex | 1f39025c6f |
134100442223 has 8 divisors (see below), whose sum is σ = 147711697536. Its totient is φ = 120725904600.
The previous prime is 134100442211. The next prime is 134100442243. The reversal of 134100442223 is 322244001431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134100442223 - 212 = 134100438127 is a prime.
It is a super-2 number, since 2×1341004422232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134100442192 and 134100442201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134100442243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59178233 + ... + 59180498.
It is an arithmetic number, because the mean of its divisors is an integer number (18463962192).
Almost surely, 2134100442223 is an apocalyptic number.
134100442223 is a deficient number, since it is larger than the sum of its proper divisors (13611255313).
134100442223 is a wasteful number, since it uses less digits than its factorization.
134100442223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118358845.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 134100442223 its reverse (322244001431), we get a palindrome (456344443654).
The spelling of 134100442223 in words is "one hundred thirty-four billion, one hundred million, four hundred forty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •