Base | Representation |
---|---|
bin | 10111001111101011111010… |
… | …010000111110011000100101 |
3 | 111101222101021021012201222022 |
4 | 113033223322100332120211 |
5 | 101344441201121130341 |
6 | 1001233110243512525 |
7 | 30351043204614005 |
oct | 2717537220763045 |
9 | 441871237181868 |
10 | 102233010333221 |
11 | 2a63585a140089 |
12 | b571538388745 |
13 | 45076ba953221 |
14 | 1b36165924005 |
15 | bc44adc80e4b |
hex | 5cfafa43e625 |
102233010333221 has 16 divisors (see below), whose sum is σ = 103899564432000. Its totient is φ = 100579867839168.
The previous prime is 102233010333197. The next prime is 102233010333241. The reversal of 102233010333221 is 122333010332201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102233010333221 is a prime.
It is a super-2 number, since 2×1022330103332212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102233010333241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89077295 + ... + 90217683.
It is an arithmetic number, because the mean of its divisors is an integer number (6493722777000).
Almost surely, 2102233010333221 is an apocalyptic number.
It is an amenable number.
102233010333221 is a deficient number, since it is larger than the sum of its proper divisors (1666554098779).
102233010333221 is a wasteful number, since it uses less digits than its factorization.
102233010333221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1146268.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 102233010333221 its reverse (122333010332201), we get a palindrome (224566020665422).
The spelling of 102233010333221 in words is "one hundred two trillion, two hundred thirty-three billion, ten million, three hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •