Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0010010001001110110 |
3 | 100211220000121200211221 |
4 | 1133323330102021312 |
5 | 3141431322211042 |
6 | 115153410020554 |
7 | 10304466114031 |
oct | 1377374221166 |
9 | 324800550757 |
10 | 103011132022 |
11 | 3a76110a167 |
12 | 17b6a27775a |
13 | 99385c0b76 |
14 | 4db2d24018 |
15 | 2a2d77bd67 |
hex | 17fbf12276 |
103011132022 has 8 divisors (see below), whose sum is σ = 154518525000. Its totient is φ = 51504957024.
The previous prime is 103011132019. The next prime is 103011132041. The reversal of 103011132022 is 220231110301.
103011132022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030111320222 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103011131987 and 103011132005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50772 + ... + 456727.
It is an arithmetic number, because the mean of its divisors is an integer number (19314815625).
Almost surely, 2103011132022 is an apocalyptic number.
103011132022 is a deficient number, since it is larger than the sum of its proper divisors (51507392978).
103011132022 is a wasteful number, since it uses less digits than its factorization.
103011132022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608990.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 103011132022 its reverse (220231110301), we get a palindrome (323242242323).
The spelling of 103011132022 in words is "one hundred three billion, eleven million, one hundred thirty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •