Base | Representation |
---|---|
bin | 1100111101110110… |
… | …1001111010100000 |
3 | 22222120110201120021 |
4 | 3033131221322200 |
5 | 24112022020233 |
6 | 1333214323224 |
7 | 152153046463 |
oct | 31735517240 |
9 | 8876421507 |
10 | 3480657568 |
11 | 1526816603 |
12 | 8117b9514 |
13 | 4361565bb |
14 | 2503a52da |
15 | 15588ae2d |
hex | cf769ea0 |
3480657568 has 48 divisors (see below), whose sum is σ = 7077248640. Its totient is φ = 1684097536.
The previous prime is 3480657553. The next prime is 3480657569. The reversal of 3480657568 is 8657560843.
It is a super-2 number, since 2×34806575682 = 24229954211351349248, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3480657569) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 120855 + ... + 146857.
It is an arithmetic number, because the mean of its divisors is an integer number (147442680).
Almost surely, 23480657568 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3480657568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3538624320).
3480657568 is an abundant number, since it is smaller than the sum of its proper divisors (3596591072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3480657568 is a wasteful number, since it uses less digits than its factorization.
3480657568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26149 (or 26141 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 52.
The square root of 3480657568 is about 58997.0979625269. The cubic root of 3480657568 is about 1515.4924122697.
The spelling of 3480657568 in words is "three billion, four hundred eighty million, six hundred fifty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •