Base | Representation |
---|---|
bin | 111110101011001001… |
… | …0000110000000000001 |
3 | 110212101220210011110001 |
4 | 1331112102012000001 |
5 | 4201120420214141 |
6 | 141455220240001 |
7 | 12503206316404 |
oct | 1752622060001 |
9 | 425356704401 |
10 | 134591569921 |
11 | 52097483616 |
12 | 22102540001 |
13 | c8cc22ca03 |
14 | 672b20dd3b |
15 | 377aedda31 |
hex | 1f56486001 |
134591569921 has 4 divisors (see below), whose sum is σ = 134694864832. Its totient is φ = 134488275012.
The previous prime is 134591569843. The next prime is 134591569949. The reversal of 134591569921 is 129965195431.
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: 129965195431 = 179533 ⋅723907.
It is a cyclic number.
It is not a de Polignac number, because 134591569921 - 215 = 134591537153 is a prime.
It is a super-2 number, since 2×1345915699212 (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 (134591569991) 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, 51645501 + ... + 51648106.
It is an arithmetic number, because the mean of its divisors is an integer number (33673716208).
Almost surely, 2134591569921 is an apocalyptic number.
It is an amenable number.
134591569921 is a deficient number, since it is larger than the sum of its proper divisors (103294911).
134591569921 is a wasteful number, since it uses less digits than its factorization.
134591569921 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103294910.
The product of its digits is 2624400, while the sum is 55.
The spelling of 134591569921 in words is "one hundred thirty-four billion, five hundred ninety-one million, five hundred sixty-nine thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •