Base | Representation |
---|---|
bin | 10111001111101011111010… |
… | …010000000101111110111011 |
3 | 111101222101021020210000002002 |
4 | 113033223322100011332323 |
5 | 101344441201041232303 |
6 | 1001233110234531215 |
7 | 30351043202632331 |
oct | 2717537220057673 |
9 | 441871236700062 |
10 | 102233010102203 |
11 | 2a635859aa2562 |
12 | b571538296b0b |
13 | 45076ba8a2026 |
14 | 1b361658a3b51 |
15 | bc44adc37788 |
hex | 5cfafa405fbb |
102233010102203 has 8 divisors (see below), whose sum is σ = 102339999268320. Its totient is φ = 102126023556480.
The previous prime is 102233010102131. The next prime is 102233010102211. The reversal of 102233010102203 is 302201010332201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102233010102203 - 244 = 84640824057787 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102233010102233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 82996403 + ... + 84219171.
It is an arithmetic number, because the mean of its divisors is an integer number (12792499908540).
Almost surely, 2102233010102203 is an apocalyptic number.
102233010102203 is a deficient number, since it is larger than the sum of its proper divisors (106989166117).
102233010102203 is an equidigital number, since it uses as much as digits as its factorization.
102233010102203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310197.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 102233010102203 its reverse (302201010332201), we get a palindrome (404434020434404).
The spelling of 102233010102203 in words is "one hundred two trillion, two hundred thirty-three billion, ten million, one hundred two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •