Base | Representation |
---|---|
bin | 11001001111000011010001… |
… | …010011100000101010010000 |
3 | 112112222002212222120221221121 |
4 | 121033003101103200222100 |
5 | 104021341213404400141 |
6 | 1032014004110332024 |
7 | 32243302215431131 |
oct | 3117032123405220 |
9 | 475862788527847 |
10 | 110985466481296 |
11 | 323aa743497400 |
12 | 105458881ba014 |
13 | 49c0b6656b594 |
14 | 1d59a220b1c88 |
15 | cc6ec00ab1d1 |
hex | 64f0d14e0a90 |
110985466481296 has 45 divisors (see below), whose sum is σ = 236361048284739. Its totient is φ = 50447728610400.
The previous prime is 110985466481257. The next prime is 110985466481339. The reversal of 110985466481296 is 692184664589011.
The square root of 110985466481296 is 10534964.
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 (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 463418701 + ... + 463658131.
Almost surely, 2110985466481296 is an apocalyptic number.
110985466481296 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
110985466481296 is the 10534964-th square number.
It is an amenable number.
110985466481296 is an abundant number, since it is smaller than the sum of its proper divisors (125375581803443).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110985466481296 is an frugal number, since it uses more digits than its factorization.
110985466481296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478892 (or 239444 counting only the distinct ones).
The product of its (nonzero) digits is 179159040, while the sum is 70.
The spelling of 110985466481296 in words is "one hundred ten trillion, nine hundred eighty-five billion, four hundred sixty-six million, four hundred eighty-one thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •