Base | Representation |
---|---|
bin | 1101000001010000… |
… | …0000101101010001 |
3 | 100000120021122201002 |
4 | 3100110000231101 |
5 | 24124144003310 |
6 | 1334443551345 |
7 | 152415134243 |
oct | 32024005521 |
9 | 10016248632 |
10 | 3494906705 |
11 | 1533869154 |
12 | 81652b555 |
13 | 4390a5244 |
14 | 252234093 |
15 | 156c52da5 |
hex | d0500b51 |
3494906705 has 4 divisors (see below), whose sum is σ = 4193888052. Its totient is φ = 2795925360.
The previous prime is 3494906689. The next prime is 3494906717. The reversal of 3494906705 is 5076094943.
It is a happy number.
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 950612224 + 2544294481 = 30832^2 + 50441^2 .
It is not a de Polignac number, because 3494906705 - 24 = 3494906689 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3494906705.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 349490666 + ... + 349490675.
It is an arithmetic number, because the mean of its divisors is an integer number (1048472013).
Almost surely, 23494906705 is an apocalyptic number.
It is an amenable number.
3494906705 is a deficient number, since it is larger than the sum of its proper divisors (698981347).
3494906705 is an equidigital number, since it uses as much as digits as its factorization.
3494906705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 698981346.
The product of its (nonzero) digits is 816480, while the sum is 47.
The square root of 3494906705 is about 59117.7359596932. The cubic root of 3494906705 is about 1517.5576406141.
The spelling of 3494906705 in words is "three billion, four hundred ninety-four million, nine hundred six thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •