Base | Representation |
---|---|
bin | 1001010010010011111101… |
… | …0110011100110001011101 |
3 | 1100011002022101211022210220 |
4 | 2110210333112130301131 |
5 | 2314240442212042341 |
6 | 33414300130551553 |
7 | 2102443163665644 |
oct | 224447726346135 |
9 | 40132271738726 |
10 | 10210200112221 |
11 | 328713786952a |
12 | 118a97b4385b9 |
13 | 590a8275b255 |
14 | 274267b8435b |
15 | 12a8cdb02a66 |
hex | 9493f59cc5d |
10210200112221 has 8 divisors (see below), whose sum is σ = 13617179865120. Its totient is φ = 6805010217072.
The previous prime is 10210200112213. The next prime is 10210200112223. The reversal of 10210200112221 is 12221100201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10210200112221 - 23 = 10210200112213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10210200112221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210200112223) 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, 447451126 + ... + 447473943.
It is an arithmetic number, because the mean of its divisors is an integer number (1702147483140).
Almost surely, 210210200112221 is an apocalyptic number.
It is an amenable number.
10210200112221 is a deficient number, since it is larger than the sum of its proper divisors (3406979752899).
10210200112221 is an equidigital number, since it uses as much as digits as its factorization.
10210200112221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 894928875.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10210200112221 its reverse (12221100201201), we get a palindrome (22431300313422).
The spelling of 10210200112221 in words is "ten trillion, two hundred ten billion, two hundred million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.334 sec. • engine limits •