Base | Representation |
---|---|
bin | 1100100010000… |
… | …10111111111111 |
3 | 21022211021000221 |
4 | 12101002333333 |
5 | 203403211111 |
6 | 14233202211 |
7 | 2414415244 |
oct | 621027777 |
9 | 238737027 |
10 | 105132031 |
11 | 54387284 |
12 | 2b260367 |
13 | 18a1c704 |
14 | dd695cb |
15 | 936a371 |
hex | 6442fff |
105132031 has 2 divisors, whose sum is σ = 105132032. Its totient is φ = 105132030.
The previous prime is 105132023. The next prime is 105132061. The reversal of 105132031 is 130231501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105132031 - 23 = 105132023 is a prime.
It is a super-2 number, since 2×1051320312 = 22105487884369922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105131996 and 105132014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105132061) 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 as a sum of consecutive naturals, namely, 52566015 + 52566016.
It is an arithmetic number, because the mean of its divisors is an integer number (52566016).
Almost surely, 2105132031 is an apocalyptic number.
105132031 is a deficient number, since it is larger than the sum of its proper divisors (1).
105132031 is an equidigital number, since it uses as much as digits as its factorization.
105132031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 105132031 is about 10253.3911951120. The cubic root of 105132031 is about 471.9670554785.
Adding to 105132031 its reverse (130231501), we get a palindrome (235363532).
It can be divided in two parts, 10513 and 2031, that added together give a square (12544 = 1122).
The spelling of 105132031 in words is "one hundred five million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •