Base | Representation |
---|---|
bin | 1100010011110… |
… | …00010010010100 |
3 | 21012021210200101 |
4 | 12021320102110 |
5 | 202413100030 |
6 | 14125023444 |
7 | 2362431364 |
oct | 611702224 |
9 | 235253611 |
10 | 103253140 |
11 | 53313681 |
12 | 2a6b4b84 |
13 | 18512443 |
14 | d9da9a4 |
15 | 90e87ca |
hex | 6278494 |
103253140 has 24 divisors (see below), whose sum is σ = 217929600. Its totient is φ = 41092128.
The previous prime is 103253119. The next prime is 103253149. The reversal of 103253140 is 41352301.
It is a super-3 number, since 3×1032531403 (a number of 25 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 (103253149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8992 + ... + 16951.
It is an arithmetic number, because the mean of its divisors is an integer number (9080400).
Almost surely, 2103253140 is an apocalyptic number.
103253140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103253140 is an abundant number, since it is smaller than the sum of its proper divisors (114676460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103253140 is a wasteful number, since it uses less digits than its factorization.
103253140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26151 (or 26149 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 19.
The square root of 103253140 is about 10161.3552245751. The cubic root of 103253140 is about 469.1385154670.
The spelling of 103253140 in words is "one hundred three million, two hundred fifty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •