Base | Representation |
---|---|
bin | 10111001101110011000001… |
… | …001010100001000110001011 |
3 | 111101111222012210102020201111 |
4 | 113031303001022201012023 |
5 | 101340324330022221303 |
6 | 1001053321501031151 |
7 | 30335466363324631 |
oct | 2715630112410613 |
9 | 441458183366644 |
10 | 102103203320203 |
11 | 2a5957a84a3a28 |
12 | b5503502554b7 |
13 | 44c83a1a4b897 |
14 | 1b2db6dd33351 |
15 | bc0e12d3db6d |
hex | 5cdcc12a118b |
102103203320203 has 4 divisors (see below), whose sum is σ = 102103241122648. Its totient is φ = 102103165517760.
The previous prime is 102103203320191. The next prime is 102103203320267. The reversal of 102103203320203 is 302023302301201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102103203320203 - 225 = 102103169765771 is a prime.
It is a super-2 number, since 2×1021032033202032 (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 (102103203320003) 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, 14509653 + ... + 20365078.
It is an arithmetic number, because the mean of its divisors is an integer number (25525810280662).
Almost surely, 2102103203320203 is an apocalyptic number.
102103203320203 is a deficient number, since it is larger than the sum of its proper divisors (37802445).
102103203320203 is an equidigital number, since it uses as much as digits as its factorization.
102103203320203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37802444.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 102103203320203 its reverse (302023302301201), we get a palindrome (404126505621404).
The spelling of 102103203320203 in words is "one hundred two trillion, one hundred three billion, two hundred three million, three hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •