Base | Representation |
---|---|
bin | 100101101000100011111101… |
… | …0000101010110001100001110 |
3 | 1121102002011211111201101020110 |
4 | 1023101013322011112030032 |
5 | 321342044332242011342 |
6 | 3132013102405300450 |
7 | 126504100125500400 |
oct | 11321077205261416 |
9 | 1542064744641213 |
10 | 331030210110222 |
11 | 9652713a738407 |
12 | 31163a57704726 |
13 | 1129302688ba5c |
14 | 5ba5d3a528b70 |
15 | 2840cc717cc9c |
hex | 12d11fa15630e |
331030210110222 has 24 divisors (see below), whose sum is σ = 770151917399976. Its totient is φ = 94580060031408.
The previous prime is 331030210110139. The next prime is 331030210110233. The reversal of 331030210110222 is 222011012030133.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 562976547513 + ... + 562976548100.
It is an arithmetic number, because the mean of its divisors is an integer number (32089663224999).
Almost surely, 2331030210110222 is an apocalyptic number.
331030210110222 is an abundant number, since it is smaller than the sum of its proper divisors (439121707289754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331030210110222 is a wasteful number, since it uses less digits than its factorization.
331030210110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125953095632 (or 1125953095625 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 331030210110222 its reverse (222011012030133), we get a palindrome (553041222140355).
The spelling of 331030210110222 in words is "three hundred thirty-one trillion, thirty billion, two hundred ten million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •