Base | Representation |
---|---|
bin | 110011010100010000… |
… | …0100110010000100001 |
3 | 101112110010012002001200 |
4 | 1212220200212100201 |
5 | 3301143013100001 |
6 | 122343100151413 |
7 | 10650614410632 |
oct | 1465040462041 |
9 | 345403162050 |
10 | 110201300001 |
11 | 42810840851 |
12 | 19436238569 |
13 | a51311ab30 |
14 | 5495c23889 |
15 | 2ceeb0c086 |
hex | 19a8826421 |
110201300001 has 24 divisors (see below), whose sum is σ = 171822059136. Its totient is φ = 67658807520.
The previous prime is 110201299997. The next prime is 110201300039. The reversal of 110201300001 is 100003102011.
It is not a de Polignac number, because 110201300001 - 22 = 110201299997 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 (110201304001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1042255 + ... + 1143108.
It is an arithmetic number, because the mean of its divisors is an integer number (7159252464).
Almost surely, 2110201300001 is an apocalyptic number.
It is an amenable number.
110201300001 is a deficient number, since it is larger than the sum of its proper divisors (61620759135).
110201300001 is a wasteful number, since it uses less digits than its factorization.
110201300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2185813 (or 2185810 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 110201300001 its reverse (100003102011), we get a palindrome (210204402012).
The spelling of 110201300001 in words is "one hundred ten billion, two hundred one million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •