Base | Representation |
---|---|
bin | 1100100010101… |
… | …10000110011110 |
3 | 21022222020100200 |
4 | 12101112012132 |
5 | 203413212040 |
6 | 14235004330 |
7 | 2415162324 |
oct | 621260636 |
9 | 238866320 |
10 | 105210270 |
11 | 54430040 |
12 | 2b2996a6 |
13 | 18a491c9 |
14 | dd89d14 |
15 | 9383630 |
hex | 645619e |
105210270 has 48 divisors (see below), whose sum is σ = 298417392. Its totient is φ = 25505280.
The previous prime is 105210269. The next prime is 105210317. The reversal of 105210270 is 72012501.
It is a super-2 number, since 2×1052102702 = 22138401826945800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 52147 + ... + 54126.
It is an arithmetic number, because the mean of its divisors is an integer number (6217029).
Almost surely, 2105210270 is an apocalyptic number.
105210270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105210270 is an abundant number, since it is smaller than the sum of its proper divisors (193207122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105210270 is a wasteful number, since it uses less digits than its factorization.
105210270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106297 (or 106294 counting only the distinct ones).
The product of its (nonzero) digits is 140, while the sum is 18.
The square root of 105210270 is about 10257.2057598549. The cubic root of 105210270 is about 472.0841053562.
Adding to 105210270 its reverse (72012501), we get a palindrome (177222771).
The spelling of 105210270 in words is "one hundred five million, two hundred ten thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •