Base | Representation |
---|---|
bin | 11001000010001010110100… |
… | …000010011101100101010001 |
3 | 112102211110220002111111202110 |
4 | 121002022310002131211101 |
5 | 103412340213311210001 |
6 | 1030055201135135533 |
7 | 32122322616325236 |
oct | 3102126402354521 |
9 | 472743802444673 |
10 | 110100212210001 |
11 | 32099268538862 |
12 | 104221aa3745a9 |
13 | 4958536a51940 |
14 | 1d28c4324178d |
15 | cade5c3b93d6 |
hex | 6422b409d951 |
110100212210001 has 32 divisors (see below), whose sum is σ = 160552055559168. Its totient is φ = 66701188319040.
The previous prime is 110100212209973. The next prime is 110100212210029. The reversal of 110100212210001 is 100012212001011.
It is an interprime number because it is at equal distance from previous prime (110100212209973) and next prime (110100212210029).
It is not a de Polignac number, because 110100212210001 - 245 = 74915840121169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110100212210201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8910915 + ... + 17309096.
It is an arithmetic number, because the mean of its divisors is an integer number (5017251736224).
Almost surely, 2110100212210001 is an apocalyptic number.
It is an amenable number.
110100212210001 is a deficient number, since it is larger than the sum of its proper divisors (50451843349167).
110100212210001 is a wasteful number, since it uses less digits than its factorization.
110100212210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26221701.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110100212210001 its reverse (100012212001011), we get a palindrome (210112424211012).
The spelling of 110100212210001 in words is "one hundred ten trillion, one hundred billion, two hundred twelve million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •