Base | Representation |
---|---|
bin | 1100100011011… |
… | …11000001101001 |
3 | 21100011102101211 |
4 | 12101233001221 |
5 | 203424443421 |
6 | 14241113121 |
7 | 2416066060 |
oct | 621570151 |
9 | 240142354 |
10 | 105312361 |
11 | 5449a810 |
12 | 2b3287a1 |
13 | 18a8380b |
14 | ddb51d7 |
15 | 93a39e1 |
hex | 646f069 |
105312361 has 16 divisors (see below), whose sum is σ = 131678208. Its totient is φ = 81824400.
The previous prime is 105312349. The next prime is 105312367. The reversal of 105312361 is 163213501.
It is a happy number.
It is not a de Polignac number, because 105312361 - 25 = 105312329 is a prime.
It is a super-2 number, since 2×1053123612 = 22181386758788642, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105312367) 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 15 ways as a sum of consecutive naturals, for example, 27706 + ... + 31276.
It is an arithmetic number, because the mean of its divisors is an integer number (8229888).
Almost surely, 2105312361 is an apocalyptic number.
105312361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105312361 is a deficient number, since it is larger than the sum of its proper divisors (26365847).
105312361 is a wasteful number, since it uses less digits than its factorization.
105312361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3972.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 105312361 is about 10262.1811034497. The cubic root of 105312361 is about 472.2367519179.
Adding to 105312361 its reverse (163213501), we get a palindrome (268525862).
The spelling of 105312361 in words is "one hundred five million, three hundred twelve thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •