Base | Representation |
---|---|
bin | 1100001110010… |
… | …00000101001101 |
3 | 21010221010122110 |
4 | 12013020011031 |
5 | 202222001110 |
6 | 14101334233 |
7 | 2353334244 |
oct | 607100515 |
9 | 233833573 |
10 | 102531405 |
11 | 529703a9 |
12 | 2a407379 |
13 | 1831ba92 |
14 | d88d95b |
15 | 9004a20 |
hex | 61c814d |
102531405 has 16 divisors (see below), whose sum is σ = 164335104. Its totient is φ = 54588480.
The previous prime is 102531397. The next prime is 102531409. The reversal of 102531405 is 504135201.
It is not a de Polignac number, because 102531405 - 23 = 102531397 is a prime.
It is a super-2 number, since 2×1025314052 = 21025378022548050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102531409) 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 15 ways as a sum of consecutive naturals, for example, 3475 + ... + 14735.
It is an arithmetic number, because the mean of its divisors is an integer number (10270944).
Almost surely, 2102531405 is an apocalyptic number.
102531405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
102531405 is a deficient number, since it is larger than the sum of its proper divisors (61803699).
102531405 is a wasteful number, since it uses less digits than its factorization.
102531405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11876.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 102531405 is about 10125.7792292742. The cubic root of 102531405 is about 468.0428726521.
Adding to 102531405 its reverse (504135201), we get a palindrome (606666606).
The spelling of 102531405 in words is "one hundred two million, five hundred thirty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •