Base | Representation |
---|---|
bin | 110011001110100011… |
… | …1100111010001110001 |
3 | 101111221210121020210100 |
4 | 1212131013213101301 |
5 | 3300300102414301 |
6 | 122312112223013 |
7 | 10643104165365 |
oct | 1463507472161 |
9 | 344853536710 |
10 | 110010201201 |
11 | 4272298845a |
12 | 193a223aa69 |
13 | a4b265c214 |
14 | 54786bb2a5 |
15 | 2cdce60286 |
hex | 199d1e7471 |
110010201201 has 6 divisors (see below), whose sum is σ = 158903623970. Its totient is φ = 73340134128.
The previous prime is 110010201193. The next prime is 110010201211. The reversal of 110010201201 is 102102010011.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 94524887601 + 15485313600 = 307449^2 + 124440^2 .
It is not a de Polignac number, because 110010201201 - 23 = 110010201193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 12223355689 = 110010201201 / (1 + 1 + 0 + 0 + 1 + 0 + 2 + 0 + 1 + 2 + 0 + 1).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110010201211) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6111677836 + ... + 6111677853.
Almost surely, 2110010201201 is an apocalyptic number.
It is an amenable number.
110010201201 is a deficient number, since it is larger than the sum of its proper divisors (48893422769).
110010201201 is a wasteful number, since it uses less digits than its factorization.
110010201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12223355695 (or 12223355692 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110010201201 its reverse (102102010011), we get a palindrome (212112211212).
The spelling of 110010201201 in words is "one hundred ten billion, ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •