Base | Representation |
---|---|
bin | 110000000111010101… |
… | …0100000111010101101 |
3 | 100212200220200002100222 |
4 | 1200032222200322231 |
5 | 3143102230203010 |
6 | 115244510301125 |
7 | 10315332025460 |
oct | 1401652407255 |
9 | 325626602328 |
10 | 103325241005 |
11 | 3a90244a968 |
12 | 180374b77a5 |
13 | 99886bb87c |
14 | 500292b2d7 |
15 | 2a4b126355 |
hex | 180eaa0ead |
103325241005 has 16 divisors (see below), whose sum is σ = 146589505920. Its totient is φ = 68408434752.
The previous prime is 103325240987. The next prime is 103325241007. The reversal of 103325241005 is 500142523301.
It is a happy number.
It is not a de Polignac number, because 103325241005 - 212 = 103325236909 is a prime.
It is a super-3 number, since 3×1033252410053 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103325241007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50898119 + ... + 50900148.
It is an arithmetic number, because the mean of its divisors is an integer number (9161844120).
Almost surely, 2103325241005 is an apocalyptic number.
It is an amenable number.
103325241005 is a deficient number, since it is larger than the sum of its proper divisors (43264264915).
103325241005 is a wasteful number, since it uses less digits than its factorization.
103325241005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101798308.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 103325241005 its reverse (500142523301), we get a palindrome (603467764306).
The spelling of 103325241005 in words is "one hundred three billion, three hundred twenty-five million, two hundred forty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •