Base | Representation |
---|---|
bin | 11001000011101001101101… |
… | …000001100100110001110101 |
3 | 112110012012212211101000220101 |
4 | 121003221231001210301311 |
5 | 103421022400100310401 |
6 | 1030214051300234101 |
7 | 32132560525332151 |
oct | 3103515501446165 |
9 | 473165784330811 |
10 | 110202100010101 |
11 | 321284a2547030 |
12 | 10439aa439b931 |
13 | 49650236b2c58 |
14 | 1d2db4acb2061 |
15 | cb1922202101 |
hex | 643a6d064c75 |
110202100010101 has 16 divisors (see below), whose sum is σ = 120280443302016. Its totient is φ = 100133755200000.
The previous prime is 110202100010083. The next prime is 110202100010113. The reversal of 110202100010101 is 101010001202011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110202100010101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110202100016101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 833844376 + ... + 833976526.
It is an arithmetic number, because the mean of its divisors is an integer number (7517527706376).
Almost surely, 2110202100010101 is an apocalyptic number.
110202100010101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110202100010101 is a deficient number, since it is larger than the sum of its proper divisors (10078343291915).
110202100010101 is a wasteful number, since it uses less digits than its factorization.
110202100010101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169404.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110202100010101 its reverse (101010001202011), we get a palindrome (211212101212112).
The spelling of 110202100010101 in words is "one hundred ten trillion, two hundred two billion, one hundred million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •