Base | Representation |
---|---|
bin | 110000001101001110… |
… | …1011100011000011001 |
3 | 100220012201001110022210 |
4 | 1200122131130120121 |
5 | 3144003411004040 |
6 | 115320300105333 |
7 | 10323254116014 |
oct | 1403235343031 |
9 | 326181043283 |
10 | 103523141145 |
11 | 3a9a41291a6 |
12 | 18091835249 |
13 | 99ba6bc148 |
14 | 5020d2437b |
15 | 2a5d6b8480 |
hex | 181a75c619 |
103523141145 has 16 divisors (see below), whose sum is σ = 165641064192. Its totient is φ = 55210995840.
The previous prime is 103523141143. The next prime is 103523141153. The reversal of 103523141145 is 541141325301.
It is not a de Polignac number, because 103523141145 - 21 = 103523141143 is a prime.
It is a super-2 number, since 2×1035231411452 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103523141143) 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, 1013904 + ... + 1111326.
It is an arithmetic number, because the mean of its divisors is an integer number (10352566512).
Almost surely, 2103523141145 is an apocalyptic number.
103523141145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
103523141145 is a deficient number, since it is larger than the sum of its proper divisors (62117923047).
103523141145 is an equidigital number, since it uses as much as digits as its factorization.
103523141145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168272.
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 103523141145 its reverse (541141325301), we get a palindrome (644664466446).
The spelling of 103523141145 in words is "one hundred three billion, five hundred twenty-three million, one hundred forty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •