Base | Representation |
---|---|
bin | 1100111000111… |
… | …01110100000010 |
3 | 21112110100020000 |
4 | 12130131310002 |
5 | 210140003232 |
6 | 14421300430 |
7 | 2452023345 |
oct | 634356402 |
9 | 245410200 |
10 | 108125442 |
11 | 56041277 |
12 | 30264716 |
13 | 1952a069 |
14 | 1050845c |
15 | 975c27c |
hex | 671dd02 |
108125442 has 20 divisors (see below), whose sum is σ = 242281446. Its totient is φ = 36041760.
The previous prime is 108125441. The next prime is 108125467. The reversal of 108125442 is 244521801.
108125442 is a `hidden beast` number, since 108 + 12 + 544 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 72948681 + 35176761 = 8541^2 + 5931^2 .
It is a super-2 number, since 2×1081254422 = 23382222415390728, 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 (108125441) 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 9 ways as a sum of consecutive naturals, for example, 333559 + ... + 333882.
Almost surely, 2108125442 is an apocalyptic number.
108125442 is an abundant number, since it is smaller than the sum of its proper divisors (134156004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108125442 is an equidigital number, since it uses as much as digits as its factorization.
108125442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667455 (or 667446 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 27.
The square root of 108125442 is about 10398.3384249600. The cubic root of 108125442 is about 476.4046208842.
The spelling of 108125442 in words is "one hundred eight million, one hundred twenty-five thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •