Base | Representation |
---|---|
bin | 1101101101001010… |
… | …1101010010101010 |
3 | 100111101220101011200 |
4 | 3123102231102222 |
5 | 30013323130120 |
6 | 1405024105030 |
7 | 160112646036 |
oct | 33322552252 |
9 | 10441811150 |
10 | 3679114410 |
11 | 1618845124 |
12 | 868165176 |
13 | 4682c039a |
14 | 26c8a51c6 |
15 | 167edce90 |
hex | db4ad4aa |
3679114410 has 96 divisors (see below), whose sum is σ = 10084718592. Its totient is φ = 929214720.
The previous prime is 3679114393. The next prime is 3679114463. The reversal of 3679114410 is 144119763.
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, 117102 + ... + 145158.
It is an arithmetic number, because the mean of its divisors is an integer number (105049152).
Almost surely, 23679114410 is an apocalyptic number.
3679114410 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 3679114410, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5042359296).
3679114410 is an abundant number, since it is smaller than the sum of its proper divisors (6405604182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3679114410 is a wasteful number, since it uses less digits than its factorization.
3679114410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28148 (or 28145 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The square root of 3679114410 is about 60655.7038538009. The cubic root of 3679114410 is about 1543.7646706250.
The spelling of 3679114410 in words is "three billion, six hundred seventy-nine million, one hundred fourteen thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •