Base | Representation |
---|---|
bin | 1001010010010100011100… |
… | …1001110111011010110110 |
3 | 1100011002122112011200220210 |
4 | 2110211013021313122312 |
5 | 2314241224220444342 |
6 | 33414321125010250 |
7 | 2102446343535000 |
oct | 224450711673266 |
9 | 40132575150823 |
10 | 10210331031222 |
11 | 32871a4758953 |
12 | 118a9b7253986 |
13 | 590aa390910a |
14 | 27427b303370 |
15 | 12a8da36379c |
hex | 949472776b6 |
10210331031222 has 64 divisors (see below), whose sum is σ = 24169619059200. Its totient is φ = 2873696541408.
The previous prime is 10210331031221. The next prime is 10210331031317. The reversal of 10210331031222 is 22213013301201.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210331031221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36886653 + ... + 37162424.
It is an arithmetic number, because the mean of its divisors is an integer number (377650297800).
Almost surely, 210210331031222 is an apocalyptic number.
10210331031222 is an abundant number, since it is smaller than the sum of its proper divisors (13959288027978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210331031222 is an equidigital number, since it uses as much as digits as its factorization.
10210331031222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74049170 (or 74049156 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10210331031222 its reverse (22213013301201), we get a palindrome (32423344332423).
The spelling of 10210331031222 in words is "ten trillion, two hundred ten billion, three hundred thirty-one million, thirty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •