Base | Representation |
---|---|
bin | 11110100001110100011011… |
… | …000011011110000011101001 |
3 | 122121101122112102120000000210 |
4 | 132201310123003132003221 |
5 | 120044301043143102013 |
6 | 1153320404015451333 |
7 | 40165233302062152 |
oct | 3641643303360351 |
9 | 577348472500023 |
10 | 134265426534633 |
11 | 39865713a93919 |
12 | 13085657826b49 |
13 | 59bc23845a9b4 |
14 | 25226a4a44929 |
15 | 107c842837cc3 |
hex | 7a1d1b0de0e9 |
134265426534633 has 8 divisors (see below), whose sum is σ = 179041908664000. Its totient is φ = 89499614380848.
The previous prime is 134265426534611. The next prime is 134265426534667. The reversal of 134265426534633 is 336435624562431.
134265426534633 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134265426534633 - 212 = 134265426530537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134265426534683) 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, 2667464533 + ... + 2667514866.
It is an arithmetic number, because the mean of its divisors is an integer number (22380238583000).
Almost surely, 2134265426534633 is an apocalyptic number.
It is an amenable number.
134265426534633 is a deficient number, since it is larger than the sum of its proper divisors (44776482129367).
134265426534633 is an equidigital number, since it uses as much as digits as its factorization.
134265426534633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5334987791.
The product of its digits is 111974400, while the sum is 57.
The spelling of 134265426534633 in words is "one hundred thirty-four trillion, two hundred sixty-five billion, four hundred twenty-six million, five hundred thirty-four thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •