Base | Representation |
---|---|
bin | 1100100001010… |
… | …10101100010111 |
3 | 21022122012110112 |
4 | 12100222230113 |
5 | 203342014341 |
6 | 14231113235 |
7 | 2413522055 |
oct | 620525427 |
9 | 238565415 |
10 | 105032471 |
11 | 543194a5 |
12 | 2b21281b |
13 | 189b62bb |
14 | dd411d5 |
15 | 934aaeb |
hex | 642ab17 |
105032471 has 4 divisors (see below), whose sum is σ = 105368352. Its totient is φ = 104696592.
The previous prime is 105032441. The next prime is 105032489. The reversal of 105032471 is 174230501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105032471 is a prime.
It is a super-3 number, since 3×1050324713 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105032401) 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 3 ways as a sum of consecutive naturals, for example, 167471 + ... + 168096.
It is an arithmetic number, because the mean of its divisors is an integer number (26342088).
Almost surely, 2105032471 is an apocalyptic number.
105032471 is a deficient number, since it is larger than the sum of its proper divisors (335881).
105032471 is an equidigital number, since it uses as much as digits as its factorization.
105032471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335880.
The product of its (nonzero) digits is 840, while the sum is 23.
The square root of 105032471 is about 10248.5350660472. The cubic root of 105032471 is about 471.8180242072.
Adding to 105032471 its reverse (174230501), we get a palindrome (279262972).
The spelling of 105032471 in words is "one hundred five million, thirty-two thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •