Base | Representation |
---|---|
bin | 11001000011101000101100… |
… | …001011100001110001101001 |
3 | 112110012010002000021111002010 |
4 | 121003220230023201301221 |
5 | 103421013133044201301 |
6 | 1030213351314430133 |
7 | 32132521545262161 |
oct | 3103505413416151 |
9 | 473163060244063 |
10 | 110201012100201 |
11 | 32127a9443a240 |
12 | 1043983bb92349 |
13 | 4964bac1a6299 |
14 | 1d2da865dd5a1 |
15 | cb18ab9585d6 |
hex | 643a2c2e1c69 |
110201012100201 has 32 divisors (see below), whose sum is σ = 166927378636800. Its totient is φ = 64062042105600.
The previous prime is 110201012100199. The next prime is 110201012100229. The reversal of 110201012100201 is 102001210102011.
It is not a de Polignac number, because 110201012100201 - 21 = 110201012100199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110201012100251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 476536501 + ... + 476767698.
It is an arithmetic number, because the mean of its divisors is an integer number (5216480582400).
Almost surely, 2110201012100201 is an apocalyptic number.
110201012100201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110201012100201 is a deficient number, since it is larger than the sum of its proper divisors (56726366536599).
110201012100201 is a wasteful number, since it uses less digits than its factorization.
110201012100201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953304357.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110201012100201 its reverse (102001210102011), we get a palindrome (212202222202212).
The spelling of 110201012100201 in words is "one hundred ten trillion, two hundred one billion, twelve million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •