Base | Representation |
---|---|
bin | 1101001001001… |
… | …01000111111101 |
3 | 21200110102001110 |
4 | 12210211013331 |
5 | 211211040131 |
6 | 14535032233 |
7 | 2506062660 |
oct | 644450775 |
9 | 250412043 |
10 | 110252541 |
11 | 57264403 |
12 | 30b0b679 |
13 | 19ac32b9 |
14 | 108dd6d7 |
15 | 9a2c646 |
hex | 69251fd |
110252541 has 8 divisors (see below), whose sum is σ = 168003904. Its totient is φ = 63001440.
The previous prime is 110252537. The next prime is 110252543. The reversal of 110252541 is 145252011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110252541 - 22 = 110252537 is a prime.
It is a super-4 number, since 4×1102525414 (a number of 33 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 5250121 = 110252541 / (1 + 1 + 0 + 2 + 5 + 2 + 5 + 4 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110252543) 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, 2625040 + ... + 2625081.
It is an arithmetic number, because the mean of its divisors is an integer number (21000488).
Almost surely, 2110252541 is an apocalyptic number.
It is an amenable number.
110252541 is a deficient number, since it is larger than the sum of its proper divisors (57751363).
110252541 is an equidigital number, since it uses as much as digits as its factorization.
110252541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5250131.
The product of its (nonzero) digits is 400, while the sum is 21.
The square root of 110252541 is about 10500.1209993028. The cubic root of 110252541 is about 479.5083812017.
The spelling of 110252541 in words is "one hundred ten million, two hundred fifty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •