Base | Representation |
---|---|
bin | 1100001110110011001… |
… | …1000010000101111101 |
3 | 202002101101222112211221 |
4 | 3003230303002011331 |
5 | 11420322043343401 |
6 | 240311041313341 |
7 | 21116150664631 |
oct | 3035463020575 |
9 | 662341875757 |
10 | 210131231101 |
11 | 81130669070 |
12 | 34884635851 |
13 | 16a7a26658c |
14 | a255844dc1 |
15 | 56ecb057a1 |
hex | 30eccc217d |
210131231101 has 16 divisors (see below), whose sum is σ = 255493085760. Its totient is φ = 170328718080.
The previous prime is 210131231099. The next prime is 210131231129. The reversal of 210131231101 is 101132131012.
It is a happy number.
210131231101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 210131231101 - 21 = 210131231099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210131231171) 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 15 ways as a sum of consecutive naturals, for example, 29567406 + ... + 29574511.
It is an arithmetic number, because the mean of its divisors is an integer number (15968317860).
Almost surely, 2210131231101 is an apocalyptic number.
It is an amenable number.
210131231101 is a deficient number, since it is larger than the sum of its proper divisors (45361854659).
210131231101 is a wasteful number, since it uses less digits than its factorization.
210131231101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59141964.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 210131231101 its reverse (101132131012), we get a palindrome (311263362113).
The spelling of 210131231101 in words is "two hundred ten billion, one hundred thirty-one million, two hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •