Base | Representation |
---|---|
bin | 101111110101000100110… |
… | …100000010101111101100 |
3 | 102122012211001111011122220 |
4 | 233311010310002233230 |
5 | 412322333421143420 |
6 | 10553534230435340 |
7 | 456315036032604 |
oct | 57650464025754 |
9 | 12565731434586 |
10 | 3286804474860 |
11 | 1057a204916a5 |
12 | 451008202b50 |
13 | 1aac3790b56a |
14 | b5121733c04 |
15 | 5a76d72c840 |
hex | 2fd44d02bec |
3286804474860 has 48 divisors (see below), whose sum is σ = 9520399173600. Its totient is φ = 846257703424.
The previous prime is 3286804474847. The next prime is 3286804474861. The reversal of 3286804474860 is 684744086823.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a junction number, because it is equal to n+sod(n) for n = 3286804474794 and 3286804474803.
It is not an unprimeable number, because it can be changed into a prime (3286804474861) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 944482305 + ... + 944485784.
It is an arithmetic number, because the mean of its divisors is an integer number (198341649450).
Almost surely, 23286804474860 is an apocalyptic number.
3286804474860 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3286804474860 is an abundant number, since it is smaller than the sum of its proper divisors (6233594698740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3286804474860 is a wasteful number, since it uses less digits than its factorization.
3286804474860 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1888968130 (or 1888968128 counting only the distinct ones).
The product of its (nonzero) digits is 49545216, while the sum is 60.
The spelling of 3286804474860 in words is "three trillion, two hundred eighty-six billion, eight hundred four million, four hundred seventy-four thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •