Base | Representation |
---|---|
bin | 101111110010111110010110… |
… | …000000100110111101010101 |
3 | 1000120021222121001211211010011 |
4 | 233302332112000212331111 |
5 | 210023044313341010401 |
6 | 2023025351404000221 |
7 | 62164152022546450 |
oct | 5762762600467525 |
9 | 1016258531754104 |
10 | 210211101110101 |
11 | 60a86033425923 |
12 | 1b6b03a0530071 |
13 | 903aa8b5a2a70 |
14 | 39ca3b3304497 |
15 | 1948116d19451 |
hex | bf2f96026f55 |
210211101110101 has 24 divisors (see below), whose sum is σ = 267950416732544. Its totient is φ = 160585668694080.
The previous prime is 210211101110063. The next prime is 210211101110111. The reversal of 210211101110101 is 101011101112012.
It is not a de Polignac number, because 210211101110101 - 233 = 210202511175509 is a prime.
It is a super-2 number, since 2×2102111011101012 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210211101110111) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1373295705 + ... + 1373448766.
Almost surely, 2210211101110101 is an apocalyptic number.
It is an amenable number.
210211101110101 is a deficient number, since it is larger than the sum of its proper divisors (57739315622443).
210211101110101 is a wasteful number, since it uses less digits than its factorization.
210211101110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2746744549 (or 2746744520 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 210211101110101 its reverse (101011101112012), we get a palindrome (311222202222113).
The spelling of 210211101110101 in words is "two hundred ten trillion, two hundred eleven billion, one hundred one million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •