Base | Representation |
---|---|
bin | 111011110001000001100… |
… | …011111101101010111000 |
3 | 112112122010001221101022220 |
4 | 323301001203331222320 |
5 | 1014242304200303111 |
6 | 12422434232044040 |
7 | 602504325533022 |
oct | 73610143755270 |
9 | 15478101841286 |
10 | 4107088681656 |
11 | 1343896542164 |
12 | 563b93833620 |
13 | 23a3b20c0c5c |
14 | 102ad9a03012 |
15 | 71c7c6c9e06 |
hex | 3bc418fdab8 |
4107088681656 has 32 divisors (see below), whose sum is σ = 10268144131200. Its totient is φ = 1368973236960.
The previous prime is 4107088681621. The next prime is 4107088681679. The reversal of 4107088681656 is 6561868807014.
It is a happy number.
It is a super-2 number, since 2×41070886816562 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4107088681656.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2922646 + ... + 4093413.
It is an arithmetic number, because the mean of its divisors is an integer number (320879504100).
Almost surely, 24107088681656 is an apocalyptic number.
It is an amenable number.
4107088681656 is an abundant number, since it is smaller than the sum of its proper divisors (6161055449544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4107088681656 is a wasteful number, since it uses less digits than its factorization.
4107088681656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7040459 (or 7040455 counting only the distinct ones).
The product of its (nonzero) digits is 15482880, while the sum is 60.
The spelling of 4107088681656 in words is "four trillion, one hundred seven billion, eighty-eight million, six hundred eighty-one thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •