Base | Representation |
---|---|
bin | 1001010010010011111101… |
… | …1010101011011111110110 |
3 | 1100011002022110220122220212 |
4 | 2110210333122223133312 |
5 | 2314240443003033420 |
6 | 33414300210425422 |
7 | 2102443206264602 |
oct | 224447732533766 |
9 | 40132273818825 |
10 | 10210201221110 |
11 | 3287138456670 |
12 | 118a97b892272 |
13 | 590a82a58bb7 |
14 | 274267d92502 |
15 | 12a8cdc713c5 |
hex | 9493f6ab7f6 |
10210201221110 has 96 divisors (see below), whose sum is σ = 21333811495392. Its totient is φ = 3488501227520.
The previous prime is 10210201221089. The next prime is 10210201221113. The reversal of 10210201221110 is 1112210201201.
It is a super-2 number, since 2×102102012211102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210201221113) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18580664 + ... + 19122276.
It is an arithmetic number, because the mean of its divisors is an integer number (222227203077).
Almost surely, 210210201221110 is an apocalyptic number.
10210201221110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10210201221110 is an abundant number, since it is smaller than the sum of its proper divisors (11123610274282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210201221110 is a wasteful number, since it uses less digits than its factorization.
10210201221110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542258 (or 542241 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10210201221110 its reverse (1112210201201), we get a palindrome (11322411422311).
The spelling of 10210201221110 in words is "ten trillion, two hundred ten billion, two hundred one million, two hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •