Base | Representation |
---|---|
bin | 110011010001010010… |
… | …1111000001110011100 |
3 | 101112012012101011220101 |
4 | 1212202211320032130 |
5 | 3300442104133040 |
6 | 122325152230444 |
7 | 10645300510555 |
oct | 1464245701634 |
9 | 345165334811 |
10 | 110102021020 |
11 | 4276a7a2002 |
12 | 19408b3b424 |
13 | a4c869a584 |
14 | 548697d32c |
15 | 2ce604b09a |
hex | 19a297839c |
110102021020 has 48 divisors (see below), whose sum is σ = 233810438400. Its totient is φ = 43547443200.
The previous prime is 110102021017. The next prime is 110102021021. The reversal of 110102021020 is 20120201011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 110102020988 and 110102021006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110102021021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1517941 + ... + 1588819.
It is an arithmetic number, because the mean of its divisors is an integer number (4871050800).
Almost surely, 2110102021020 is an apocalyptic number.
110102021020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110102021020 is an abundant number, since it is smaller than the sum of its proper divisors (123708417380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102021020 is a wasteful number, since it uses less digits than its factorization.
110102021020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71758 (or 71756 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110102021020 its reverse (20120201011), we get a palindrome (130222222031).
The spelling of 110102021020 in words is "one hundred ten billion, one hundred two million, twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •