Base | Representation |
---|---|
bin | 11011111000111000000… |
… | …111100001010001000000 |
3 | 20210012210222001100000221 |
4 | 123320320013201101000 |
5 | 222344441202100001 |
6 | 4024232043552424 |
7 | 255314402642200 |
oct | 33707007412100 |
9 | 6705728040027 |
10 | 1916496909376 |
11 | 6798665a6995 |
12 | 26b51ab2b714 |
13 | 10b95675028a |
14 | 68a8a790400 |
15 | 34cbc1e11a1 |
hex | 1be381e1440 |
1916496909376 has 189 divisors, whose sum is σ = 4510973591319. Its totient is φ = 805507481856.
The previous prime is 1916496909359. The next prime is 1916496909401. The reversal of 1916496909376 is 6739096946191.
The square root of 1916496909376 is 1384376.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
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 26 ways as a sum of consecutive naturals, for example, 4573978095 + ... + 4573978513.
Almost surely, 21916496909376 is an apocalyptic number.
1916496909376 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
1916496909376 is the 1384376-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1916496909376
1916496909376 is an abundant number, since it is smaller than the sum of its proper divisors (2594476681943).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1916496909376 is an frugal number, since it uses more digits than its factorization.
1916496909376 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982 (or 487 counting only the distinct ones).
The product of its (nonzero) digits is 119042784, while the sum is 70.
The spelling of 1916496909376 in words is "one trillion, nine hundred sixteen billion, four hundred ninety-six million, nine hundred nine thousand, three hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •