Base | Representation |
---|---|
bin | 1100100011110… |
… | …11011100011111 |
3 | 21100021000011220 |
4 | 12101323130133 |
5 | 203433110411 |
6 | 14242144423 |
7 | 2416400301 |
oct | 621733437 |
9 | 240230156 |
10 | 105363231 |
11 | 54524a56 |
12 | 2b352113 |
13 | 18aa0a0c |
14 | ddc9971 |
15 | 93b3b06 |
hex | 647b71f |
105363231 has 4 divisors (see below), whose sum is σ = 140484312. Its totient is φ = 70242152.
The previous prime is 105363217. The next prime is 105363233. The reversal of 105363231 is 132363501.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132363501 = 3 ⋅44121167.
It is a cyclic number.
It is not a de Polignac number, because 105363231 - 223 = 96974623 is a prime.
It is a super-2 number, since 2×1053632312 = 22202820893518722, which contains 22 as substring.
It is a nialpdrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105363233) 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 in 3 ways as a sum of consecutive naturals, for example, 17560536 + ... + 17560541.
It is an arithmetic number, because the mean of its divisors is an integer number (35121078).
Almost surely, 2105363231 is an apocalyptic number.
105363231 is a deficient number, since it is larger than the sum of its proper divisors (35121081).
105363231 is an equidigital number, since it uses as much as digits as its factorization.
105363231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35121080.
The product of its (nonzero) digits is 1620, while the sum is 24.
The square root of 105363231 is about 10264.6593221597. The cubic root of 105363231 is about 472.3127759681.
The spelling of 105363231 in words is "one hundred five million, three hundred sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •