Base | Representation |
---|---|
bin | 10111001111001111000011… |
… | …001010111001011010000110 |
3 | 111101212102021120201210010002 |
4 | 113033033003022321122012 |
5 | 101343434214413101042 |
6 | 1001210543235401302 |
7 | 30345565234535021 |
oct | 2717170312713206 |
9 | 441772246653102 |
10 | 102202021222022 |
11 | 2a6236a7640187 |
12 | b56752a153232 |
13 | 45047bc694237 |
14 | 1b34865da41b8 |
15 | bc37983c7132 |
hex | 5cf3c32b9686 |
102202021222022 has 8 divisors (see below), whose sum is σ = 153534957753072. Its totient is φ = 51023701971000.
The previous prime is 102202021222019. The next prime is 102202021222027. The reversal of 102202021222022 is 220222120202201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1022020212220223 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102202021221985 and 102202021222003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202021222027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38654318354 + ... + 38654320997.
It is an arithmetic number, because the mean of its divisors is an integer number (19191869719134).
Almost surely, 2102202021222022 is an apocalyptic number.
102202021222022 is a deficient number, since it is larger than the sum of its proper divisors (51332936531050).
102202021222022 is an equidigital number, since it uses as much as digits as its factorization.
102202021222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77308640014.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 102202021222022 its reverse (220222120202201), we get a palindrome (322424141424223).
The spelling of 102202021222022 in words is "one hundred two trillion, two hundred two billion, twenty-one million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •