Base | Representation |
---|---|
bin | 111010001101111010010… |
… | …000010110011010110100 |
3 | 112011110102021020200111102 |
4 | 322031322100112122310 |
5 | 1011021330402042220 |
6 | 12301514101225232 |
7 | 562016140006100 |
oct | 72157220263264 |
9 | 15143367220442 |
10 | 4000665659060 |
11 | 1302744516124 |
12 | 547432a02218 |
13 | 2303519a3035 |
14 | db8c18d8900 |
15 | 6e0ee647775 |
hex | 3a37a4166b4 |
4000665659060 has 72 divisors (see below), whose sum is σ = 9882864500040. Its totient is φ = 1356244893696.
The previous prime is 4000665659057. The next prime is 4000665659113. The reversal of 4000665659060 is 609565660004.
It is a happy number.
4000665659060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 275287003684 + 3725378655376 = 524678^2 + 1930124^2 .
It is a junction number, because it is equal to n+sod(n) for n = 4000665658996 and 4000665659014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22847117 + ... + 23021556.
It is an arithmetic number, because the mean of its divisors is an integer number (137262006945).
Almost surely, 24000665659060 is an apocalyptic number.
It is an amenable number.
4000665659060 is an abundant number, since it is smaller than the sum of its proper divisors (5882198840980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4000665659060 is a wasteful number, since it uses less digits than its factorization.
4000665659060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45868785 (or 45868776 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 47.
The spelling of 4000665659060 in words is "four trillion, six hundred sixty-five million, six hundred fifty-nine thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •