Base | Representation |
---|---|
bin | 111010010011000100100… |
… | …000110111011110101001 |
3 | 112011222201102021001021112 |
4 | 322103010200313132221 |
5 | 1011114202324020212 |
6 | 12304231552120105 |
7 | 562303350064031 |
oct | 72230440673651 |
9 | 15158642231245 |
10 | 4006206470057 |
11 | 1305028124470 |
12 | 54851a536035 |
13 | 230a258a571c |
14 | dbc897368c1 |
15 | 6e325cc9422 |
hex | 3a4c48377a9 |
4006206470057 has 8 divisors (see below), whose sum is σ = 4627489826592. Its totient is φ = 3427770241600.
The previous prime is 4006206470047. The next prime is 4006206470093. The reversal of 4006206470057 is 7500746026004.
4006206470057 is digitally balanced in base 2, because in such base 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 not a de Polignac number, because 4006206470057 - 214 = 4006206453673 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4006206469996 and 4006206470023.
It is not an unprimeable number, because it can be changed into a prime (4006206470047) 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, 10711781819 + ... + 10711782192.
It is an arithmetic number, because the mean of its divisors is an integer number (578436228324).
Almost surely, 24006206470057 is an apocalyptic number.
It is an amenable number.
4006206470057 is a deficient number, since it is larger than the sum of its proper divisors (621283356535).
4006206470057 is a wasteful number, since it uses less digits than its factorization.
4006206470057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21423564039.
The product of its (nonzero) digits is 282240, while the sum is 41.
The spelling of 4006206470057 in words is "four trillion, six billion, two hundred six million, four hundred seventy thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •