Base | Representation |
---|---|
bin | 110000000101000000… |
… | …1000001111000111001 |
3 | 100212111110221002121212 |
4 | 1200022001001320321 |
5 | 3142422244212040 |
6 | 115233043012505 |
7 | 10313364130334 |
oct | 1401201017071 |
9 | 325443832555 |
10 | 103247257145 |
11 | 3a87242649a |
12 | 1801536a135 |
13 | 99754b6086 |
14 | 4dd642b61b |
15 | 2a4436ed65 |
hex | 180a041e39 |
103247257145 has 8 divisors (see below), whose sum is σ = 124022753856. Its totient is φ = 82513775536.
The previous prime is 103247257123. The next prime is 103247257147. The reversal of 103247257145 is 541752742301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103247257145 - 210 = 103247256121 is a prime.
It is a super-2 number, since 2×1032472571452 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103247257147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10498367 + ... + 10508196.
It is an arithmetic number, because the mean of its divisors is an integer number (15502844232).
Almost surely, 2103247257145 is an apocalyptic number.
It is an amenable number.
103247257145 is a deficient number, since it is larger than the sum of its proper divisors (20775496711).
103247257145 is an equidigital number, since it uses as much as digits as its factorization.
103247257145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21007551.
The product of its (nonzero) digits is 235200, while the sum is 41.
Adding to 103247257145 its reverse (541752742301), we get a palindrome (644999999446).
The spelling of 103247257145 in words is "one hundred three billion, two hundred forty-seven million, two hundred fifty-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •