Base | Representation |
---|---|
bin | 10000001100110001011… |
… | …001001011101111011011 |
3 | 10221102102120122022000021 |
4 | 100030301121023233123 |
5 | 121214341123334224 |
6 | 2211224131451311 |
7 | 143266521125335 |
oct | 20146131135733 |
9 | 3842376568007 |
10 | 1113225214939 |
11 | 39a1306807a2 |
12 | 15b900a56b37 |
13 | 80c90a22246 |
14 | 3bc47ada455 |
15 | 1de56a8d1e4 |
hex | 1033164bbdb |
1113225214939 has 2 divisors, whose sum is σ = 1113225214940. Its totient is φ = 1113225214938.
The previous prime is 1113225214919. The next prime is 1113225214973. The reversal of 1113225214939 is 9394125223111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1113225214939 - 219 = 1113224690651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113225214895 and 1113225214904.
It is not a weakly prime, because it can be changed into another prime (1113225214919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556612607469 + 556612607470.
It is an arithmetic number, because the mean of its divisors is an integer number (556612607470).
Almost surely, 21113225214939 is an apocalyptic number.
1113225214939 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113225214939 is an equidigital number, since it uses as much as digits as its factorization.
1113225214939 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 116640, while the sum is 43.
The spelling of 1113225214939 in words is "one trillion, one hundred thirteen billion, two hundred twenty-five million, two hundred fourteen thousand, nine hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •