Base | Representation |
---|---|
bin | 111110101010101001… |
… | …0010110110000010001 |
3 | 110212100202100021120022 |
4 | 1331111102112300101 |
5 | 4201102131030304 |
6 | 141453422153225 |
7 | 12502614306326 |
oct | 1752522266021 |
9 | 425322307508 |
10 | 134574861329 |
11 | 52089001167 |
12 | 220b8a22815 |
13 | c8c892c77c |
14 | 6728d00b4d |
15 | 37797dcebe |
hex | 1f55496c11 |
134574861329 has 4 divisors (see below), whose sum is σ = 138915985920. Its totient is φ = 130233736740.
The previous prime is 134574861307. The next prime is 134574861347. The reversal of 134574861329 is 923168475431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 923168475431 = 869461 ⋅1061771.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134574861329 is a prime.
It is a super-2 number, since 2×1345748613292 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134574861829) 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, 2170562249 + ... + 2170562310.
It is an arithmetic number, because the mean of its divisors is an integer number (34728996480).
Almost surely, 2134574861329 is an apocalyptic number.
It is an amenable number.
134574861329 is a deficient number, since it is larger than the sum of its proper divisors (4341124591).
134574861329 is an equidigital number, since it uses as much as digits as its factorization.
134574861329 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4341124590.
The product of its digits is 4354560, while the sum is 53.
The spelling of 134574861329 in words is "one hundred thirty-four billion, five hundred seventy-four million, eight hundred sixty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.024 sec. • engine limits •