Base | Representation |
---|---|
bin | 101110001010010111000100… |
… | …010010100011010010100110 |
3 | 222121211201112101022010022110 |
4 | 232022113010102203102212 |
5 | 203102303231142441402 |
6 | 1555443022150141450 |
7 | 60522601646162403 |
oct | 5612270422432246 |
9 | 877751471263273 |
10 | 203022102312102 |
11 | 5976420aa86267 |
12 | 1a92b063351886 |
13 | 8938b95bb3a68 |
14 | 381c4720d12aa |
15 | 187110ddc156c |
hex | b8a5c44a34a6 |
203022102312102 has 8 divisors (see below), whose sum is σ = 406044204624216. Its totient is φ = 67674034104032.
The previous prime is 203022102312091. The next prime is 203022102312137. The reversal of 203022102312102 is 201213201220302.
It is a sphenic number, since it is the product of 3 distinct primes.
203022102312102 is an admirable number.
It is a super-2 number, since 2×2030221023121022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16918508526003 + ... + 16918508526014.
It is an arithmetic number, because the mean of its divisors is an integer number (50755525578027).
Almost surely, 2203022102312102 is an apocalyptic number.
203022102312102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
203022102312102 is a wasteful number, since it uses less digits than its factorization.
203022102312102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33837017052022.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 203022102312102 its reverse (201213201220302), we get a palindrome (404235303532404).
The spelling of 203022102312102 in words is "two hundred three trillion, twenty-two billion, one hundred two million, three hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •