Base | Representation |
---|---|
bin | 1010010100100011110… |
… | …00000101111101010101 |
3 | 1020220101002210022200111 |
4 | 11022101320011331111 |
5 | 21302242442002221 |
6 | 430530020443021 |
7 | 34423115242510 |
oct | 5122170057525 |
9 | 1226332708614 |
10 | 354634719061 |
11 | 127444065387 |
12 | 58892549471 |
13 | 27598b5383c |
14 | 13243209d77 |
15 | 9358da3be1 |
hex | 5291e05f55 |
354634719061 has 4 divisors (see below), whose sum is σ = 405296821792. Its totient is φ = 303972616332.
The previous prime is 354634719029. The next prime is 354634719071. The reversal of 354634719061 is 160917436453.
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.
It is not a de Polignac number, because 354634719061 - 25 = 354634719029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 354634718996 and 354634719014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (354634719071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25331051355 + ... + 25331051368.
It is an arithmetic number, because the mean of its divisors is an integer number (101324205448).
Almost surely, 2354634719061 is an apocalyptic number.
It is an amenable number.
354634719061 is a deficient number, since it is larger than the sum of its proper divisors (50662102731).
354634719061 is an equidigital number, since it uses as much as digits as its factorization.
354634719061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50662102730.
The product of its (nonzero) digits is 1632960, while the sum is 49.
The spelling of 354634719061 in words is "three hundred fifty-four billion, six hundred thirty-four million, seven hundred nineteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •