Base | Representation |
---|---|
bin | 110011010100010000… |
… | …0001101110110010101 |
3 | 101112110002222222220201 |
4 | 1212220200031312111 |
5 | 3301143001400041 |
6 | 122343054100501 |
7 | 10650613513303 |
oct | 1465040156625 |
9 | 345402888821 |
10 | 110201200021 |
11 | 42810782720 |
12 | 194361aa731 |
13 | a5130b4483 |
14 | 5495bd9273 |
15 | 2ceeadc631 |
hex | 19a880dd95 |
110201200021 has 32 divisors (see below), whose sum is σ = 128252620800. Its totient is φ = 93632760000.
The previous prime is 110201199961. The next prime is 110201200063. The reversal of 110201200021 is 120002102011.
It is not a de Polignac number, because 110201200021 - 29 = 110201199509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110201199980 and 110201200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201201021) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 31385656 + ... + 31389166.
It is an arithmetic number, because the mean of its divisors is an integer number (4007894400).
Almost surely, 2110201200021 is an apocalyptic number.
110201200021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110201200021 is a deficient number, since it is larger than the sum of its proper divisors (18051420779).
110201200021 is a wasteful number, since it uses less digits than its factorization.
110201200021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5521.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 110201200021 its reverse (120002102011), we get a palindrome (230203302032).
The spelling of 110201200021 in words is "one hundred ten billion, two hundred one million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •