Base | Representation |
---|---|
bin | 1100010011001100111… |
… | …1100000010101000110 |
3 | 202012102202212201022220 |
4 | 3010303033200111012 |
5 | 11430232123200402 |
6 | 241024221033210 |
7 | 21160351500066 |
oct | 3046317402506 |
9 | 665382781286 |
10 | 211313100102 |
11 | 81687810805 |
12 | 34b543b5806 |
13 | 16c08080250 |
14 | a3287b53a6 |
15 | 576b75ddbc |
hex | 31333e0546 |
211313100102 has 128 divisors (see below), whose sum is σ = 468959984640. Its totient is φ = 63079395840.
The previous prime is 211313100101. The next prime is 211313100107. The reversal of 211313100102 is 201001313112.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211313100101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 136948743 + ... + 136950285.
It is an arithmetic number, because the mean of its divisors is an integer number (3663749880).
Almost surely, 2211313100102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211313100102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (234479992320).
211313100102 is an abundant number, since it is smaller than the sum of its proper divisors (257646884538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211313100102 is a wasteful number, since it uses less digits than its factorization.
211313100102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1998.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 211313100102 its reverse (201001313112), we get a palindrome (412314413214).
The spelling of 211313100102 in words is "two hundred eleven billion, three hundred thirteen million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •