Base | Representation |
---|---|
bin | 10111001101111001100011… |
… | …100000101100101101000010 |
3 | 111101112122022221022200201222 |
4 | 113031321203200230231002 |
5 | 101340433213313324302 |
6 | 1001100442143555042 |
7 | 30336135330241616 |
oct | 2715714340545502 |
9 | 441478287280658 |
10 | 102110222011202 |
11 | 2a59877a3543a9 |
12 | b55178a8bba82 |
13 | 44c8c4cb9a192 |
14 | 1b30238157346 |
15 | bc11c40eada2 |
hex | 5cde6382cb42 |
102110222011202 has 8 divisors (see below), whose sum is σ = 155104134700800. Its totient is φ = 50408843777604.
The previous prime is 102110222011151. The next prime is 102110222011211. The reversal of 102110222011202 is 202110222011201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1021102220112022 (a number of 29 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 323133613802 + ... + 323133614117.
It is an arithmetic number, because the mean of its divisors is an integer number (19388016837600).
Almost surely, 2102110222011202 is an apocalyptic number.
102110222011202 is a deficient number, since it is larger than the sum of its proper divisors (52993912689598).
102110222011202 is an equidigital number, since it uses as much as digits as its factorization.
102110222011202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646267228000.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102110222011202 its reverse (202110222011201), we get a palindrome (304220444022403).
Subtracting 102110222011202 from its reverse (202110222011201), we obtain a palindrome (99999999999999).
The spelling of 102110222011202 in words is "one hundred two trillion, one hundred ten billion, two hundred twenty-two million, eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •