Base | Representation |
---|---|
bin | 1110101101000100… |
… | …1001011101000011 |
3 | 101012002020112102212 |
4 | 3223101021131003 |
5 | 31040432002211 |
6 | 1451400532335 |
7 | 166546100336 |
oct | 35321113503 |
9 | 11162215385 |
10 | 3947140931 |
11 | 1746070448 |
12 | 921a810ab |
13 | 4ab9a4b66 |
14 | 29631461d |
15 | 1817d338b |
hex | eb449743 |
3947140931 has 8 divisors (see below), whose sum is σ = 3955479120. Its totient is φ = 3938813568.
The previous prime is 3947140909. The next prime is 3947140949. The reversal of 3947140931 is 1390417493.
It is a happy number.
3947140931 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 a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3947140931 is a prime.
It is a super-2 number, since 2×39471409312 = 31159843058351093522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3947140231) 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, 1236920 + ... + 1240106.
It is an arithmetic number, because the mean of its divisors is an integer number (494434890).
Almost surely, 23947140931 is an apocalyptic number.
3947140931 is a deficient number, since it is larger than the sum of its proper divisors (8338189).
3947140931 is a wasteful number, since it uses less digits than its factorization.
3947140931 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5413.
The product of its (nonzero) digits is 81648, while the sum is 41.
The square root of 3947140931 is about 62826.2758008144. The cubic root of 3947140931 is about 1580.3776444680.
The spelling of 3947140931 in words is "three billion, nine hundred forty-seven million, one hundred forty thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •