Base | Representation |
---|---|
bin | 11001011110111… |
… | …01110100010101 |
3 | 112220020121121122 |
4 | 30233131310111 |
5 | 414211110433 |
6 | 33113453325 |
7 | 5204003450 |
oct | 1457356425 |
9 | 486217548 |
10 | 213769493 |
11 | aa738203 |
12 | 5b711245 |
13 | 35398832 |
14 | 20568497 |
15 | 13b79198 |
hex | cbddd15 |
213769493 has 4 divisors (see below), whose sum is σ = 244308000. Its totient is φ = 183230988.
The previous prime is 213769483. The next prime is 213769499. The reversal of 213769493 is 394967312.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 213769493 - 212 = 213765397 is a prime.
It is a super-2 number, since 2×2137694932 = 91394792274954098, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213769499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15269243 + ... + 15269256.
It is an arithmetic number, because the mean of its divisors is an integer number (61077000).
Almost surely, 2213769493 is an apocalyptic number.
It is an amenable number.
213769493 is a deficient number, since it is larger than the sum of its proper divisors (30538507).
213769493 is an equidigital number, since it uses as much as digits as its factorization.
213769493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30538506.
The product of its digits is 244944, while the sum is 44.
The square root of 213769493 is about 14620.8581485493. The cubic root of 213769493 is about 597.9275656758.
The spelling of 213769493 in words is "two hundred thirteen million, seven hundred sixty-nine thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •