Base | Representation |
---|---|
bin | 101111111110111001… |
… | …1111101001000110101 |
3 | 100211222012122112001012 |
4 | 1133331303331020311 |
5 | 3142012340100341 |
6 | 115200450242005 |
7 | 10305326553200 |
oct | 1377563751065 |
9 | 324865575035 |
10 | 103042503221 |
11 | 3a777896879 |
12 | 17b78886305 |
13 | 9941c55cc8 |
14 | 4db716c937 |
15 | 2a313c70eb |
hex | 17fdcfd235 |
103042503221 has 6 divisors (see below), whose sum is σ = 119865769110. Its totient is φ = 88322145576.
The previous prime is 103042503197. The next prime is 103042503229. The reversal of 103042503221 is 122305240301.
It can be written as a sum of positive squares in only one way, i.e., 102793336996 + 249166225 = 320614^2 + 15785^2 .
It is not a de Polignac number, because 103042503221 - 210 = 103042502197 is a prime.
It is a super-3 number, since 3×1030425032213 (a number of 34 digits) contains 333 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 (103042503229) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1051454066 + ... + 1051454163.
It is an arithmetic number, because the mean of its divisors is an integer number (19977628185).
Almost surely, 2103042503221 is an apocalyptic number.
It is an amenable number.
103042503221 is a deficient number, since it is larger than the sum of its proper divisors (16823265889).
103042503221 is an equidigital number, since it uses as much as digits as its factorization.
103042503221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2102908243 (or 2102908236 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 103042503221 its reverse (122305240301), we get a palindrome (225347743522).
The spelling of 103042503221 in words is "one hundred three billion, forty-two million, five hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •