Base | Representation |
---|---|
bin | 1101101101001000… |
… | …1101011101100100 |
3 | 100111101122202100000 |
4 | 3123102031131210 |
5 | 30013304442121 |
6 | 1405021221300 |
7 | 160111563660 |
oct | 33322153544 |
9 | 10441582300 |
10 | 3678984036 |
11 | 1618766182 |
12 | 868101830 |
13 | 468275c40 |
14 | 26c86d8a0 |
15 | 167eb4526 |
hex | db48d764 |
3678984036 has 144 divisors (see below), whose sum is σ = 11869929344. Its totient is φ = 970258176.
The previous prime is 3678984019. The next prime is 3678984073. The reversal of 3678984036 is 6304898763.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 67656 + ... + 109248.
Almost surely, 23678984036 is an apocalyptic number.
3678984036 is a gapful number since it is divisible by the number (36) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3678984036, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5934964672).
3678984036 is an abundant number, since it is smaller than the sum of its proper divisors (8190945308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3678984036 is a wasteful number, since it uses less digits than its factorization.
3678984036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41632 (or 41618 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 54.
The square root of 3678984036 is about 60654.6291390855. The cubic root of 3678984036 is about 1543.7464353352.
The spelling of 3678984036 in words is "three billion, six hundred seventy-eight million, nine hundred eighty-four thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •