Base | Representation |
---|---|
bin | 111001011100010100010… |
… | …110001110100010100101 |
3 | 111222100222020012210020212 |
4 | 321130110112032202211 |
5 | 1004133302034103234 |
6 | 12221230143105205 |
7 | 555122441033132 |
oct | 71342426164245 |
9 | 14870866183225 |
10 | 3947416316069 |
11 | 12920a9668646 |
12 | 5390518a2205 |
13 | 2283169a9465 |
14 | d90ad817589 |
15 | 6ca348a95ce |
hex | 3971458e8a5 |
3947416316069 has 8 divisors (see below), whose sum is σ = 3970296790752. Its totient is φ = 3924536566320.
The previous prime is 3947416316033. The next prime is 3947416316111. The reversal of 3947416316069 is 9606136147493.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3947416316069 - 212 = 3947416311973 is a prime.
It is a super-2 number, since 2×39474163160692 (a number of 26 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 = 3947416315999 and 3947416316017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3947416316269) 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, 13900634 + ... + 14181764.
It is an arithmetic number, because the mean of its divisors is an integer number (496287098844).
Almost surely, 23947416316069 is an apocalyptic number.
It is an amenable number.
3947416316069 is a deficient number, since it is larger than the sum of its proper divisors (22880474683).
3947416316069 is a wasteful number, since it uses less digits than its factorization.
3947416316069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 362467.
The product of its (nonzero) digits is 17635968, while the sum is 59.
The spelling of 3947416316069 in words is "three trillion, nine hundred forty-seven billion, four hundred sixteen million, three hundred sixteen thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •