Base | Representation |
---|---|
bin | 1100100110101… |
… | …00111111111111 |
3 | 21100221122100200 |
4 | 12103110333333 |
5 | 204031330142 |
6 | 14254054543 |
7 | 2422455603 |
oct | 623247777 |
9 | 240848320 |
10 | 105730047 |
11 | 54755605 |
12 | 2b4aa453 |
13 | 18b9b977 |
14 | 10083503 |
15 | 943764c |
hex | 64d4fff |
105730047 has 6 divisors (see below), whose sum is σ = 152721192. Its totient is φ = 70486692.
The previous prime is 105730039. The next prime is 105730067. The reversal of 105730047 is 740037501.
It is not a de Polignac number, because 105730047 - 23 = 105730039 is a prime.
It is a super-2 number, since 2×1057300472 = 22357685677244418, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105730047.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105730007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5873883 + ... + 5873900.
It is an arithmetic number, because the mean of its divisors is an integer number (25453532).
Almost surely, 2105730047 is an apocalyptic number.
105730047 is a deficient number, since it is larger than the sum of its proper divisors (46991145).
105730047 is a wasteful number, since it uses less digits than its factorization.
105730047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11747789 (or 11747786 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 105730047 is about 10282.5117067767. The cubic root of 105730047 is about 472.8602510030.
Adding to 105730047 its reverse (740037501), we get a palindrome (845767548).
The spelling of 105730047 in words is "one hundred five million, seven hundred thirty thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •