Base | Representation |
---|---|
bin | 110000001101010000… |
… | …1111101000001011011 |
3 | 100220012210021112002201 |
4 | 1200122201331001123 |
5 | 3144004211322134 |
6 | 115320341311031 |
7 | 10323300141616 |
oct | 1403241750133 |
9 | 326183245081 |
10 | 103524323419 |
11 | 3a9a4866490 |
12 | 18092105477 |
13 | 99baa1430a |
14 | 502115117d |
15 | 2a5d84d914 |
hex | 181a87d05b |
103524323419 has 48 divisors (see below), whose sum is σ = 122807028960. Its totient is φ = 86471608320.
The previous prime is 103524323417. The next prime is 103524323423. The reversal of 103524323419 is 914323425301.
It is not a de Polignac number, because 103524323419 - 21 = 103524323417 is a prime.
It is a super-2 number, since 2×1035243234192 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is not an unprimeable number, because it can be changed into a prime (103524323417) 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 47 ways as a sum of consecutive naturals, for example, 54802827 + ... + 54804715.
It is an arithmetic number, because the mean of its divisors is an integer number (2558479770).
Almost surely, 2103524323419 is an apocalyptic number.
103524323419 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
103524323419 is a deficient number, since it is larger than the sum of its proper divisors (19282705541).
103524323419 is a wasteful number, since it uses less digits than its factorization.
103524323419 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2348 (or 2329 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 37.
The spelling of 103524323419 in words is "one hundred three billion, five hundred twenty-four million, three hundred twenty-three thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.871 sec. • engine limits •