Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …000100101111001101010110 |
3 | 111101012011020202022022001221 |
4 | 113030131022010233031112 |
5 | 101332322022304100342 |
6 | 1000543113403440554 |
7 | 30326023643501446 |
oct | 2714351204571526 |
9 | 441164222268057 |
10 | 102011011003222 |
11 | 2a55a699320722 |
12 | b53650122615a |
13 | 44bc79b988029 |
14 | 1b29505bd8126 |
15 | bbd8192b1a67 |
hex | 5cc74a12f356 |
102011011003222 has 4 divisors (see below), whose sum is σ = 153016516504836. Its totient is φ = 51005505501610.
The previous prime is 102011011003193. The next prime is 102011011003229. The reversal of 102011011003222 is 222300110110201.
102011011003222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 102011011003196 and 102011011003205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011011003229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25502752750804 + ... + 25502752750807.
It is an arithmetic number, because the mean of its divisors is an integer number (38254129126209).
Almost surely, 2102011011003222 is an apocalyptic number.
102011011003222 is a deficient number, since it is larger than the sum of its proper divisors (51005505501614).
102011011003222 is an equidigital number, since it uses as much as digits as its factorization.
102011011003222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51005505501613.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102011011003222 its reverse (222300110110201), we get a palindrome (324311121113423).
The spelling of 102011011003222 in words is "one hundred two trillion, eleven billion, eleven million, three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •