Base | Representation |
---|---|
bin | 1100010011001010001… |
… | …0011111011100011110 |
3 | 202012101221200012122000 |
4 | 3010302202133130132 |
5 | 11430221113044443 |
6 | 241023120103130 |
7 | 21160146262335 |
oct | 3046242373436 |
9 | 665357605560 |
10 | 211301299998 |
11 | 81681091158 |
12 | 34b50464aa6 |
13 | 16c057ab239 |
14 | a326dc2d1c |
15 | 576a6cc8d3 |
hex | 313289f71e |
211301299998 has 16 divisors (see below), whose sum is σ = 469558444560. Its totient is φ = 70433766648.
The previous prime is 211301299997. The next prime is 211301300011. The reversal of 211301299998 is 899992103112.
It is a hoax number, since the sum of its digits (54) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (54), and also a Moran number because the ratio is a prime number: 3912987037 = 211301299998 / (2 + 1 + 1 + 3 + 0 + 1 + 2 + 9 + 9 + 9 + 9 + 8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211301299997) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1956493465 + ... + 1956493572.
It is an arithmetic number, because the mean of its divisors is an integer number (29347402785).
Almost surely, 2211301299998 is an apocalyptic number.
211301299998 is an abundant number, since it is smaller than the sum of its proper divisors (258257144562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211301299998 is a wasteful number, since it uses less digits than its factorization.
211301299998 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3912987048 (or 3912987042 counting only the distinct ones).
The product of its (nonzero) digits is 629856, while the sum is 54.
The spelling of 211301299998 in words is "two hundred eleven billion, three hundred one million, two hundred ninety-nine thousand, nine hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •