Base | Representation |
---|---|
bin | 11001001010001… |
… | …11001000010101 |
3 | 112201010201012111 |
4 | 30211013020111 |
5 | 413012231000 |
6 | 32535351021 |
7 | 5141640031 |
oct | 1445071025 |
9 | 481121174 |
10 | 211055125 |
11 | a9153926 |
12 | 5a822471 |
13 | 349581b8 |
14 | 2005d1c1 |
15 | 137decba |
hex | c947215 |
211055125 has 16 divisors (see below), whose sum is σ = 264122352. Its totient is φ = 168379200.
The previous prime is 211055123. The next prime is 211055129. The reversal of 211055125 is 521550112.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 97653924 + 113401201 = 9882^2 + 10649^2 .
It is not a de Polignac number, because 211055125 - 21 = 211055123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211055096 and 211055105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211055123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47499 + ... + 51751.
It is an arithmetic number, because the mean of its divisors is an integer number (16507647).
Almost surely, 2211055125 is an apocalyptic number.
211055125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
211055125 is a deficient number, since it is larger than the sum of its proper divisors (53067227).
211055125 is an equidigital number, since it uses as much as digits as its factorization.
211055125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4665 (or 4655 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 22.
The square root of 211055125 is about 14527.7364031703. The cubic root of 211055125 is about 595.3860216602.
The spelling of 211055125 in words is "two hundred eleven million, fifty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •