Base | Representation |
---|---|
bin | 101110100100100011… |
… | …1101110110000101000 |
3 | 100120010221100202122200 |
4 | 1131021013232300220 |
5 | 3114310304323422 |
6 | 113535555020200 |
7 | 10140236365605 |
oct | 1351107566050 |
9 | 316127322580 |
10 | 100011011112 |
11 | 394616769a1 |
12 | 1747159a660 |
13 | 957ab965ac |
14 | 4baa6c96ac |
15 | 29051b22ac |
hex | 17491eec28 |
100011011112 has 24 divisors (see below), whose sum is σ = 270863155290. Its totient is φ = 33337003680.
The previous prime is 100011011041. The next prime is 100011011239. The reversal of 100011011112 is 211110110001.
It can be written as a sum of positive squares in only one way, i.e., 76603847076 + 23407164036 = 276774^2 + 152994^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100011011094 and 100011011103.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 694520839 + ... + 694520982.
Almost surely, 2100011011112 is an apocalyptic number.
100011011112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100011011112 is an abundant number, since it is smaller than the sum of its proper divisors (170852144178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011011112 is a wasteful number, since it uses less digits than its factorization.
100011011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1389041833 (or 1389041826 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 100011011112 its reverse (211110110001), we get a palindrome (311121121113).
The spelling of 100011011112 in words is "one hundred billion, eleven million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •