Base | Representation |
---|---|
bin | 100001001110100… |
… | …1100111011100001 |
3 | 2212200222101210001 |
4 | 1002131030323201 |
5 | 4240411421033 |
6 | 302345140001 |
7 | 36425634103 |
oct | 10235147341 |
9 | 2780871701 |
10 | 1114951393 |
11 | 5223a7536 |
12 | 27148a601 |
13 | 149cb716a |
14 | a8111573 |
15 | 67d3ae7d |
hex | 4274cee1 |
1114951393 has 2 divisors, whose sum is σ = 1114951394. Its totient is φ = 1114951392.
The previous prime is 1114951391. The next prime is 1114951433. The reversal of 1114951393 is 3931594111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 701561169 + 413390224 = 26487^2 + 20332^2 .
It is an emirp because it is prime and its reverse (3931594111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1114951393 - 21 = 1114951391 is a prime.
Together with 1114951391, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1114951391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557475696 + 557475697.
It is an arithmetic number, because the mean of its divisors is an integer number (557475697).
Almost surely, 21114951393 is an apocalyptic number.
It is an amenable number.
1114951393 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114951393 is an equidigital number, since it uses as much as digits as its factorization.
1114951393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14580, while the sum is 37.
The square root of 1114951393 is about 33390.8878737898. The cubic root of 1114951393 is about 1036.9360614146.
The spelling of 1114951393 in words is "one billion, one hundred fourteen million, nine hundred fifty-one thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •