Base | Representation |
---|---|
bin | 10111011011001001111111… |
… | …010110101101110011111111 |
3 | 111111202201210002221102212220 |
4 | 113123021333112231303333 |
5 | 102000344430342114403 |
6 | 1003035143544100423 |
7 | 30462015632260032 |
oct | 2733117726556377 |
9 | 444681702842786 |
10 | 103021222223103 |
11 | 2a90a067207208 |
12 | b67a252a64713 |
13 | 4563b236261c2 |
14 | 1b6237a467019 |
15 | bd9c42209953 |
hex | 5db27f5adcff |
103021222223103 has 8 divisors (see below), whose sum is σ = 138695237685888. Its totient is φ = 68014010787864.
The previous prime is 103021222223063. The next prime is 103021222223201. The reversal of 103021222223103 is 301322222120301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103021222223103 - 212 = 103021222219007 is a prime.
It is a super-2 number, since 2×1030212222231032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103021222223303) 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, 166701006525 + ... + 166701007142.
It is an arithmetic number, because the mean of its divisors is an integer number (17336904710736).
Almost surely, 2103021222223103 is an apocalyptic number.
103021222223103 is a deficient number, since it is larger than the sum of its proper divisors (35674015462785).
103021222223103 is a wasteful number, since it uses less digits than its factorization.
103021222223103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333402013773.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 103021222223103 its reverse (301322222120301), we get a palindrome (404343444343404).
The spelling of 103021222223103 in words is "one hundred three trillion, twenty-one billion, two hundred twenty-two million, two hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.194 sec. • engine limits •