Base | Representation |
---|---|
bin | 101111111110010101… |
… | …0000011101001010101 |
3 | 100211220212012022122201 |
4 | 1133330222003221111 |
5 | 3141442410144341 |
6 | 115154515124501 |
7 | 10305003111103 |
oct | 1377452035125 |
9 | 324825168581 |
10 | 103023131221 |
11 | 3a76796535a |
12 | 17b722a3731 |
13 | 993ac3269a |
14 | 4db4768c73 |
15 | 2a2e84c331 |
hex | 17fca83a55 |
103023131221 has 4 divisors (see below), whose sum is σ = 103051198944. Its totient is φ = 102995063500.
The previous prime is 103023131209. The next prime is 103023131249. The reversal of 103023131221 is 122131320301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103023131221 - 213 = 103023123029 is a prime.
It is a super-2 number, since 2×1030231312212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103023131291) 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, 14028355 + ... + 14035696.
It is an arithmetic number, because the mean of its divisors is an integer number (25762799736).
Almost surely, 2103023131221 is an apocalyptic number.
It is an amenable number.
103023131221 is a deficient number, since it is larger than the sum of its proper divisors (28067723).
103023131221 is an equidigital number, since it uses as much as digits as its factorization.
103023131221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28067722.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 103023131221 its reverse (122131320301), we get a palindrome (225154451522).
The spelling of 103023131221 in words is "one hundred three billion, twenty-three million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •