Base | Representation |
---|---|
bin | 10000001001111101101… |
… | …011110100011001110001 |
3 | 10221010122110100201200210 |
4 | 100021331223310121301 |
5 | 121142202302414301 |
6 | 2210005025334333 |
7 | 143132021001663 |
oct | 20117553643161 |
9 | 3833573321623 |
10 | 1110210201201 |
11 | 398923796302 |
12 | 15b1bb1973a9 |
13 | 809001b204a |
14 | 3ba3d506533 |
15 | 1dd2c030ad6 |
hex | 1027daf4671 |
1110210201201 has 4 divisors (see below), whose sum is σ = 1480280268272. Its totient is φ = 740140134132.
The previous prime is 1110210201173. The next prime is 1110210201239. The reversal of 1110210201201 is 1021020120111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1110210201201 - 213 = 1110210193009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1110210201271) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 185035033531 + ... + 185035033536.
It is an arithmetic number, because the mean of its divisors is an integer number (370070067068).
Almost surely, 21110210201201 is an apocalyptic number.
It is an amenable number.
1110210201201 is a deficient number, since it is larger than the sum of its proper divisors (370070067071).
1110210201201 is an equidigital number, since it uses as much as digits as its factorization.
1110210201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370070067070.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1110210201201 its reverse (1021020120111), we get a palindrome (2131230321312).
It can be divided in two parts, 11 and 10210201201, that multiplied together give a palindrome (112312213211).
The spelling of 1110210201201 in words is "one trillion, one hundred ten billion, two hundred ten million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •