Base | Representation |
---|---|
bin | 1110101101101010… |
… | …0100010001001101 |
3 | 101012020212222110010 |
4 | 3223122210101031 |
5 | 31042100010221 |
6 | 1451525503433 |
7 | 166606063065 |
oct | 35332442115 |
9 | 11166788403 |
10 | 3949610061 |
11 | 17474a7551 |
12 | 922871b79 |
13 | 4ac35a997 |
14 | 2967983a5 |
15 | 181b1ec76 |
hex | eb6a444d |
3949610061 has 8 divisors (see below), whose sum is σ = 5266438720. Its totient is φ = 2632927392.
The previous prime is 3949610053. The next prime is 3949610069. The reversal of 3949610061 is 1600169493.
3949610061 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (3949610053) and next prime (3949610069).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3949610061 - 23 = 3949610053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3949610069) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77496 + ... + 117918.
It is an arithmetic number, because the mean of its divisors is an integer number (658304840).
Almost surely, 23949610061 is an apocalyptic number.
It is an amenable number.
3949610061 is a deficient number, since it is larger than the sum of its proper divisors (1316828659).
3949610061 is a wasteful number, since it uses less digits than its factorization.
3949610061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72995.
The product of its (nonzero) digits is 34992, while the sum is 39.
The square root of 3949610061 is about 62845.9231851995. The cubic root of 3949610061 is about 1580.7071103219.
The spelling of 3949610061 in words is "three billion, nine hundred forty-nine million, six hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •