Base | Representation |
---|---|
bin | 1100101001001… |
… | …00010111101000 |
3 | 21101120011022022 |
4 | 12110210113220 |
5 | 204122231034 |
6 | 14305044012 |
7 | 2425311446 |
oct | 624442750 |
9 | 241504268 |
10 | 106055144 |
11 | 54957888 |
12 | 2b626608 |
13 | 18c83930 |
14 | 10129b96 |
15 | 949db2e |
hex | 65245e8 |
106055144 has 32 divisors (see below), whose sum is σ = 216378120. Its totient is φ = 48439296.
The previous prime is 106055143. The next prime is 106055153. The reversal of 106055144 is 441550601.
It can be written as a sum of positive squares in 4 ways, for example, as 31024900 + 75030244 = 5570^2 + 8662^2 .
It is a super-2 number, since 2×1060551442 = 22495387137721472, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is not an unprimeable number, because it can be changed into a prime (106055143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4832 + ... + 15344.
Almost surely, 2106055144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106055144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108189060).
106055144 is an abundant number, since it is smaller than the sum of its proper divisors (110322976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106055144 is a wasteful number, since it uses less digits than its factorization.
106055144 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10629 (or 10625 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 106055144 is about 10298.3078221619. The cubic root of 106055144 is about 473.3444027476.
The spelling of 106055144 in words is "one hundred six million, fifty-five thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •