Base | Representation |
---|---|
bin | 1100100111101… |
… | …11101010010110 |
3 | 21101012212010000 |
4 | 12103313222112 |
5 | 204100401042 |
6 | 14301112130 |
7 | 2423616534 |
oct | 623675226 |
9 | 241185100 |
10 | 105872022 |
11 | 54842243 |
12 | 2b558646 |
13 | 18c1b489 |
14 | 100bd154 |
15 | 946474c |
hex | 64f7a96 |
105872022 has 80 divisors (see below), whose sum is σ = 258223680. Its totient is φ = 32285952.
The previous prime is 105872017. The next prime is 105872029. The reversal of 105872022 is 220278501.
It is a super-2 number, since 2×1058720222 = 22417770084736968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105872029) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 101379 + ... + 102417.
It is an arithmetic number, because the mean of its divisors is an integer number (3227796).
Almost surely, 2105872022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105872022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129111840).
105872022 is an abundant number, since it is smaller than the sum of its proper divisors (152351658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105872022 is a wasteful number, since it uses less digits than its factorization.
105872022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1107 (or 1098 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 105872022 is about 10289.4131027965. The cubic root of 105872022 is about 473.0718096185.
The spelling of 105872022 in words is "one hundred five million, eight hundred seventy-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •