Base | Representation |
---|---|
bin | 11110100111101000000110… |
… | …101011011111110100111001 |
3 | 122122210210122201001012000201 |
4 | 132213220012223133310321 |
5 | 120122320412231232013 |
6 | 1154224005214202201 |
7 | 40236122155156024 |
oct | 3647500653376471 |
9 | 578723581035021 |
10 | 134664516664633 |
11 | 399a999aa6243a |
12 | 1312aa761b3361 |
13 | 5a1aa6a428007 |
14 | 2537b2403c1bb |
15 | 1087dee4053dd |
hex | 7a7a06adfd39 |
134664516664633 has 4 divisors (see below), whose sum is σ = 134665016133748. Its totient is φ = 134664017195520.
The previous prime is 134664516664621. The next prime is 134664516664747. The reversal of 134664516664633 is 336466615466431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 88345562189824 + 46318954474809 = 9399232^2 + 6805803^2 .
It is a cyclic number.
It is not a de Polignac number, because 134664516664633 - 237 = 134527077711161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134664516664033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 249329916 + ... + 249869437.
It is an arithmetic number, because the mean of its divisors is an integer number (33666254033437).
Almost surely, 2134664516664633 is an apocalyptic number.
It is an amenable number.
134664516664633 is a deficient number, since it is larger than the sum of its proper divisors (499469115).
134664516664633 is an equidigital number, since it uses as much as digits as its factorization.
134664516664633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 499469114.
The product of its digits is 403107840, while the sum is 64.
The spelling of 134664516664633 in words is "one hundred thirty-four trillion, six hundred sixty-four billion, five hundred sixteen million, six hundred sixty-four thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •