Base | Representation |
---|---|
bin | 1100100011110… |
… | …11011100011110 |
3 | 21100021000011212 |
4 | 12101323130132 |
5 | 203433110410 |
6 | 14242144422 |
7 | 2416400300 |
oct | 621733436 |
9 | 240230155 |
10 | 105363230 |
11 | 54524a55 |
12 | 2b352112 |
13 | 18aa0a0b |
14 | ddc9970 |
15 | 93b3b05 |
hex | 647b71e |
105363230 has 48 divisors (see below), whose sum is σ = 230234400. Its totient is φ = 34550208.
The previous prime is 105363217. The next prime is 105363233. The reversal of 105363230 is 32363501.
It is a super-2 number, since 2×1053632302 = 22202820472065800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a nialpdrome in base 14.
It is a junction number, because it is equal to n+sod(n) for n = 105363196 and 105363205.
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 polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6596 + ... + 15944.
It is an arithmetic number, because the mean of its divisors is an integer number (4796550).
Almost surely, 2105363230 is an apocalyptic number.
105363230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105363230 is an abundant number, since it is smaller than the sum of its proper divisors (124871170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105363230 is a wasteful number, since it uses less digits than its factorization.
105363230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9393 (or 9386 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 23.
The square root of 105363230 is about 10264.6592734489. The cubic root of 105363230 is about 472.3127744738.
The spelling of 105363230 in words is "one hundred five million, three hundred sixty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •