Base | Representation |
---|---|
bin | 110100001001101000… |
… | …0100001000010110010 |
3 | 101201001221011120201122 |
4 | 1220103100201002302 |
5 | 3313330003341300 |
6 | 123240514302242 |
7 | 11043162250100 |
oct | 1502320410262 |
9 | 351057146648 |
10 | 111992246450 |
11 | 4354a781387 |
12 | 19855b87982 |
13 | a73a18b066 |
14 | 55c5a20c70 |
15 | 2da6e77c85 |
hex | 1a134210b2 |
111992246450 has 54 divisors (see below), whose sum is σ = 242350497783. Its totient is φ = 38391662400.
The previous prime is 111992246381. The next prime is 111992246453. The reversal of 111992246450 is 54642299111.
It can be written as a sum of positive squares in 5 ways, for example, as 75422186161 + 36570060289 = 274631^2 + 191233^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=236635.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (111992246453) by changing a digit.
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 26 ways as a sum of consecutive naturals, for example, 16561070 + ... + 16567830.
Almost surely, 2111992246450 is an apocalyptic number.
111992246450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
111992246450 is an abundant number, since it is smaller than the sum of its proper divisors (130358251333).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111992246450 is an frugal number, since it uses more digits than its factorization.
111992246450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13548 (or 6775 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 44.
The spelling of 111992246450 in words is "one hundred eleven billion, nine hundred ninety-two million, two hundred forty-six thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •