Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1111010010100000001 |
3 | 101112110002211221011000 |
4 | 1212220133322110001 |
5 | 3301142441320001 |
6 | 122343052242213 |
7 | 10650613031100 |
oct | 1465037722401 |
9 | 345402757130 |
10 | 110201120001 |
11 | 42810728595 |
12 | 19436170369 |
13 | a513086c1b |
14 | 5495bb8037 |
15 | 2ceeac3a86 |
hex | 19a87fa501 |
110201120001 has 24 divisors (see below), whose sum is σ = 189915764640. Its totient is φ = 62972067816.
The previous prime is 110201119961. The next prime is 110201120017. The reversal of 110201120001 is 100021102011.
It is a happy number.
It is not a de Polignac number, because 110201120001 - 211 = 110201117953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110201120041) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41646871 + ... + 41649516.
It is an arithmetic number, because the mean of its divisors is an integer number (7913156860).
Almost surely, 2110201120001 is an apocalyptic number.
It is an amenable number.
110201120001 is a deficient number, since it is larger than the sum of its proper divisors (79714644639).
110201120001 is an equidigital number, since it uses as much as digits as its factorization.
110201120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83296410 (or 83296397 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110201120001 its reverse (100021102011), we get a palindrome (210222222012).
The spelling of 110201120001 in words is "one hundred ten billion, two hundred one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •