Base | Representation |
---|---|
bin | 10111001111010000000100… |
… | …001011111111111111111011 |
3 | 111101212112002121021120122002 |
4 | 113033100010023333333323 |
5 | 101343443433134431303 |
6 | 1001211243403251215 |
7 | 30345634251335552 |
oct | 2717200413777773 |
9 | 441775077246562 |
10 | 102203112030203 |
11 | 2a624107347548 |
12 | b567793519b0b |
13 | 4504934677172 |
14 | 1b3492abccd99 |
15 | bc380e044788 |
hex | 5cf4042ffffb |
102203112030203 has 8 divisors (see below), whose sum is σ = 102374986178400. Its totient is φ = 102031382135808.
The previous prime is 102203112030193. The next prime is 102203112030241. The reversal of 102203112030203 is 302030211302201.
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 102203112030203 - 238 = 101928234123259 is a prime.
It is a super-2 number, since 2×1022031120302032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102203112030703) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34645223 + ... + 37479296.
It is an arithmetic number, because the mean of its divisors is an integer number (12796873272300).
Almost surely, 2102203112030203 is an apocalyptic number.
102203112030203 is a deficient number, since it is larger than the sum of its proper divisors (171874148197).
102203112030203 is a wasteful number, since it uses less digits than its factorization.
102203112030203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72126901.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 102203112030203 its reverse (302030211302201), we get a palindrome (404233323332404).
The spelling of 102203112030203 in words is "one hundred two trillion, two hundred three billion, one hundred twelve million, thirty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •