Base | Representation |
---|---|
bin | 100000100000100101… |
… | …101110100111100101 |
3 | 10100002200201220102221 |
4 | 200200211232213211 |
5 | 1032442030441212 |
6 | 24011423232341 |
7 | 2344005231166 |
oct | 404045564745 |
9 | 110080656387 |
10 | 34906499557 |
11 | 13892899846 |
12 | 69221486b1 |
13 | 33a3a47687 |
14 | 1991d2b76d |
15 | d94761807 |
hex | 82096e9e5 |
34906499557 has 4 divisors (see below), whose sum is σ = 34907255980. Its totient is φ = 34905743136.
The previous prime is 34906499543. The next prime is 34906499561. The reversal of 34906499557 is 75599460943.
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 8036405316 + 26870094241 = 89646^2 + 163921^2 .
It is a cyclic number.
It is not a de Polignac number, because 34906499557 - 231 = 32759015909 is a prime.
It is a super-2 number, since 2×349064995572 (a number of 22 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 = 34906499495 and 34906499504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34906499587) 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, 304158 + ... + 402895.
It is an arithmetic number, because the mean of its divisors is an integer number (8726813995).
Almost surely, 234906499557 is an apocalyptic number.
It is an amenable number.
34906499557 is a deficient number, since it is larger than the sum of its proper divisors (756423).
34906499557 is an equidigital number, since it uses as much as digits as its factorization.
34906499557 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 756422.
The product of its (nonzero) digits is 36741600, while the sum is 61.
The spelling of 34906499557 in words is "thirty-four billion, nine hundred six million, four hundred ninety-nine thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •