Base | Representation |
---|---|
bin | 100000001000000… |
… | …0010101000000000 |
3 | 2210010100101010112 |
4 | 1000100002220000 |
5 | 4201423300010 |
6 | 254544050452 |
7 | 35466253163 |
oct | 10020025000 |
9 | 2703311115 |
10 | 1077946880 |
11 | 50352249a |
12 | 261003a28 |
13 | 14242bbba |
14 | a323bada |
15 | 6497ba05 |
hex | 40402a00 |
1077946880 has 240 divisors, whose sum is σ = 2894386176. Its totient is φ = 384368640.
The previous prime is 1077946861. The next prime is 1077946951. The reversal of 1077946880 is 886497701.
It is a super-2 number, since 2×10779468802 = 2323938952203468800, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22935017 + ... + 22935063.
Almost surely, 21077946880 is an apocalyptic number.
1077946880 is a gapful number since it is divisible by the number (10) 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 1077946880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1447193088).
1077946880 is an abundant number, since it is smaller than the sum of its proper divisors (1816439296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1077946880 is an equidigital number, since it uses as much as digits as its factorization.
1077946880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135 (or 102 counting only the distinct ones).
The product of its (nonzero) digits is 677376, while the sum is 50.
The square root of 1077946880 is about 32832.1013643659. The cubic root of 1077946880 is about 1025.3350100654.
The spelling of 1077946880 in words is "one billion, seventy-seven million, nine hundred forty-six thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •