Base | Representation |
---|---|
bin | 111111000010101… |
… | …0110001100000000 |
3 | 12110102100221100210 |
4 | 1332011112030000 |
5 | 13313011041231 |
6 | 545522514120 |
7 | 103264005144 |
oct | 17605261400 |
9 | 5412327323 |
10 | 2115330816 |
11 | 99605a395 |
12 | 4b0505940 |
13 | 279327c51 |
14 | 160d1b224 |
15 | c5a94a46 |
hex | 7e156300 |
2115330816 has 72 divisors (see below), whose sum is σ = 5638210480. Its totient is φ = 704065536.
The previous prime is 2115330793. The next prime is 2115330823. The reversal of 2115330816 is 6180335112.
It is a super-2 number, since 2×21153308162 = 8949248922238451712, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 653490 + ... + 656718.
Almost surely, 22115330816 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 2115330816, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2819105240).
2115330816 is an abundant number, since it is smaller than the sum of its proper divisors (3522879664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2115330816 is an equidigital number, since it uses as much as digits as its factorization.
2115330816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4101 (or 4087 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 2115330816 is about 45992.7256856995. The cubic root of 2115330816 is about 1283.6878541694.
Adding to 2115330816 its reverse (6180335112), we get a palindrome (8295665928).
The spelling of 2115330816 in words is "two billion, one hundred fifteen million, three hundred thirty thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •