Base | Representation |
---|---|
bin | 110011010001010010… |
… | …1110011001001001001 |
3 | 101112012012100010100022 |
4 | 1212202211303021021 |
5 | 3300442103001301 |
6 | 122325151550225 |
7 | 10645300363064 |
oct | 1464245631111 |
9 | 345165303308 |
10 | 110102000201 |
11 | 4276a7883a6 |
12 | 19408b2b375 |
13 | a4c8690c5b |
14 | 54869758db |
15 | 2ce6044d1b |
hex | 19a2973249 |
110102000201 has 8 divisors (see below), whose sum is σ = 114893592000. Its totient is φ = 105310787472.
The previous prime is 110102000191. The next prime is 110102000221. The reversal of 110102000201 is 102000201011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110102000201 - 230 = 109028258377 is a prime.
It is a super-2 number, since 2×1101020002012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110102000221) 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 7 ways as a sum of consecutive naturals, for example, 610550 + ... + 770048.
It is an arithmetic number, because the mean of its divisors is an integer number (14361699000).
Almost surely, 2110102000201 is an apocalyptic number.
It is an amenable number.
110102000201 is a deficient number, since it is larger than the sum of its proper divisors (4791591799).
110102000201 is a wasteful number, since it uses less digits than its factorization.
110102000201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189535.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 110102000201 its reverse (102000201011), we get a palindrome (212102201212).
The spelling of 110102000201 in words is "one hundred ten billion, one hundred two million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •