Base | Representation |
---|---|
bin | 1000100111110100… |
… | …1100101001101001 |
3 | 12222022011212012011 |
4 | 2021331030221221 |
5 | 14220004134233 |
6 | 1021400115521 |
7 | 111233051125 |
oct | 21175145151 |
9 | 5868155164 |
10 | 2314521193 |
11 | a8853a036 |
12 | 547165ba1 |
13 | 2ab68a88a |
14 | 17d56c585 |
15 | d82de0cd |
hex | 89f4ca69 |
2314521193 has 2 divisors, whose sum is σ = 2314521194. Its totient is φ = 2314521192.
The previous prime is 2314521191. The next prime is 2314521203. The reversal of 2314521193 is 3911254132.
2314521193 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2304768064 + 9753129 = 48008^2 + 3123^2 .
It is a cyclic number.
It is not a de Polignac number, because 2314521193 - 21 = 2314521191 is a prime.
It is a super-2 number, since 2×23145211932 = 10714016705692286498, which contains 22 as substring.
Together with 2314521191, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2314521191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1157260596 + 1157260597.
It is an arithmetic number, because the mean of its divisors is an integer number (1157260597).
Almost surely, 22314521193 is an apocalyptic number.
It is an amenable number.
2314521193 is a deficient number, since it is larger than the sum of its proper divisors (1).
2314521193 is an equidigital number, since it uses as much as digits as its factorization.
2314521193 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6480, while the sum is 31.
The square root of 2314521193 is about 48109.4709282902. The cubic root of 2314521193 is about 1322.7782761391.
The spelling of 2314521193 in words is "two billion, three hundred fourteen million, five hundred twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •