Base | Representation |
---|---|
bin | 11001010001101… |
… | …11110000110101 |
3 | 112202222210020101 |
4 | 30220313300311 |
5 | 413240301012 |
6 | 33012434101 |
7 | 5153213425 |
oct | 1450676065 |
9 | 482883211 |
10 | 212040757 |
11 | a97673a5 |
12 | 5b018931 |
13 | 34c11a06 |
14 | 20238485 |
15 | 13936d57 |
hex | ca37c35 |
212040757 has 8 divisors (see below), whose sum is σ = 216260280. Its totient is φ = 207829440.
The previous prime is 212040743. The next prime is 212040761. The reversal of 212040757 is 757040212.
It can be written as a sum of positive squares in 4 ways, for example, as 34644996 + 177395761 = 5886^2 + 13319^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 212040757 - 211 = 212038709 is a prime.
It is a super-2 number, since 2×2120407572 = 89922565258266098, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212040707) 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, 89407 + ... + 91747.
It is an arithmetic number, because the mean of its divisors is an integer number (27032535).
Almost surely, 2212040757 is an apocalyptic number.
It is an amenable number.
212040757 is a deficient number, since it is larger than the sum of its proper divisors (4219523).
212040757 is a wasteful number, since it uses less digits than its factorization.
212040757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4103.
The product of its (nonzero) digits is 3920, while the sum is 28.
The square root of 212040757 is about 14561.6193124254. The cubic root of 212040757 is about 596.3114044999.
Adding to 212040757 its reverse (757040212), we get a palindrome (969080969).
The spelling of 212040757 in words is "two hundred twelve million, forty thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •