Base | Representation |
---|---|
bin | 110100000000000000… |
… | …0000000000000000000 |
3 | 101200020102012120022012 |
4 | 1220000000000000000 |
5 | 3312144300242241 |
6 | 123144453232052 |
7 | 11032160053046 |
oct | 1500000000000 |
9 | 350212176265 |
10 | 111669149696 |
11 | 433a4361a75 |
12 | 19785932628 |
13 | a6b8264450 |
14 | 5594b58396 |
15 | 2d889056eb |
hex | 1a00000000 |
111669149696 has 68 divisors (see below), whose sum is σ = 240518168562. Its totient is φ = 51539607552.
The previous prime is 111669149651. The next prime is 111669149701. The reversal of 111669149696 is 696941966111.
It can be written as a sum of positive squares in only one way, i.e., 107374182400 + 4294967296 = 327680^2 + 65536^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8589934586 + ... + 8589934598.
Almost surely, 2111669149696 is an apocalyptic number.
111669149696 is a gapful number since it is divisible by the number (16) 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 111669149696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120259084281).
111669149696 is an abundant number, since it is smaller than the sum of its proper divisors (128849018866).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111669149696 is an frugal number, since it uses more digits than its factorization.
111669149696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79 (or 15 counting only the distinct ones).
The product of its digits is 3779136, while the sum is 59.
The spelling of 111669149696 in words is "one hundred eleven billion, six hundred sixty-nine million, one hundred forty-nine thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •