Base | Representation |
---|---|
bin | 1011100010011001… |
… | …0101011001100110 |
3 | 21222211122210100000 |
4 | 2320212111121212 |
5 | 22320321304440 |
6 | 1231152402130 |
7 | 136514356215 |
oct | 27046253146 |
9 | 7884583300 |
10 | 3097056870 |
11 | 134a231736 |
12 | 725246346 |
13 | 3a483753b |
14 | 21546d07c |
15 | 131d66730 |
hex | b8995666 |
3097056870 has 48 divisors (see below), whose sum is σ = 8350589520. Its totient is φ = 825881184.
The previous prime is 3097056773. The next prime is 3097056929. The reversal of 3097056870 is 786507903.
It is a happy number.
3097056870 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×30970568702 = 19183522512028393800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 634825 + ... + 639684.
It is an arithmetic number, because the mean of its divisors is an integer number (173970615).
Almost surely, 23097056870 is an apocalyptic number.
3097056870 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3097056870 is an abundant number, since it is smaller than the sum of its proper divisors (5253532650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3097056870 is a wasteful number, since it uses less digits than its factorization.
3097056870 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1274531 (or 1274519 counting only the distinct ones).
The product of its (nonzero) digits is 317520, while the sum is 45.
The square root of 3097056870 is about 55651.2072645329. The cubic root of 3097056870 is about 1457.6381513251.
The spelling of 3097056870 in words is "three billion, ninety-seven million, fifty-six thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •