Base | Representation |
---|---|
bin | 111000011011000… |
… | …0010011100111101 |
3 | 11212221102020101112 |
4 | 1300312002130331 |
5 | 12334130322023 |
6 | 511510051405 |
7 | 64626024245 |
oct | 16066023475 |
9 | 4787366345 |
10 | 1893214013 |
11 | 891740789 |
12 | 44a049b65 |
13 | 2422c8ba2 |
14 | 13d61cb25 |
15 | b131c478 |
hex | 70d8273d |
1893214013 has 2 divisors, whose sum is σ = 1893214014. Its totient is φ = 1893214012.
The previous prime is 1893213977. The next prime is 1893214031. The reversal of 1893214013 is 3104123981.
Together with next prime (1893214031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1648197604 + 245016409 = 40598^2 + 15653^2 .
It is a cyclic number.
It is not a de Polignac number, because 1893214013 - 212 = 1893209917 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1893214513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 946607006 + 946607007.
It is an arithmetic number, because the mean of its divisors is an integer number (946607007).
Almost surely, 21893214013 is an apocalyptic number.
It is an amenable number.
1893214013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1893214013 is an equidigital number, since it uses as much as digits as its factorization.
1893214013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 1893214013 is about 43511.0791982916. The cubic root of 1893214013 is about 1237.0860324431.
Adding to 1893214013 its reverse (3104123981), we get a palindrome (4997337994).
The spelling of 1893214013 in words is "one billion, eight hundred ninety-three million, two hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •