Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0100011100101001100 |
3 | 101111221011022100020021 |
4 | 1212130210203211030 |
5 | 3300240224323040 |
6 | 122311143231524 |
7 | 10642633111015 |
oct | 1463444434514 |
9 | 344834270207 |
10 | 110001011020 |
11 | 4271878076a |
12 | 1939b1485a4 |
13 | a4b0792144 |
14 | 54773a800c |
15 | 2cdc24724a |
hex | 199c92394c |
110001011020 has 48 divisors (see below), whose sum is σ = 232746958080. Its totient is φ = 43668282816.
The previous prime is 110001011017. The next prime is 110001011047. The reversal of 110001011020 is 20110100011.
It is a super-2 number, since 2×1100010110202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110001010994 and 110001011012.
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 15 ways as a sum of consecutive naturals, for example, 10734019 + ... + 10744261.
It is an arithmetic number, because the mean of its divisors is an integer number (4848894960).
Almost surely, 2110001011020 is an apocalyptic number.
110001011020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110001011020 is an abundant number, since it is smaller than the sum of its proper divisors (122745947060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001011020 is a wasteful number, since it uses less digits than its factorization.
110001011020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14254 (or 14252 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 110001011020 its reverse (20110100011), we get a palindrome (130111111031).
The spelling of 110001011020 in words is "one hundred ten billion, one million, eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •