Base | Representation |
---|---|
bin | 10000001100100100110… |
… | …000011111111001100011 |
3 | 10221101212210201222202101 |
4 | 100030210300133321203 |
5 | 121213422341114021 |
6 | 2211151120031231 |
7 | 143261335204144 |
oct | 20144460377143 |
9 | 3841783658671 |
10 | 1113013223011 |
11 | 39a031a48058 |
12 | 15b861a62517 |
13 | 80c58b29831 |
14 | 3bc278b5acb |
15 | 1de43165a91 |
hex | 10324c1fe63 |
1113013223011 has 2 divisors, whose sum is σ = 1113013223012. Its totient is φ = 1113013223010.
The previous prime is 1113013222991. The next prime is 1113013223027. The reversal of 1113013223011 is 1103223103111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1113013223011 - 231 = 1110865739363 is a prime.
It is a super-2 number, since 2×11130132230112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1113013223011.
It is not a weakly prime, because it can be changed into another prime (1113013223051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556506611505 + 556506611506.
It is an arithmetic number, because the mean of its divisors is an integer number (556506611506).
Almost surely, 21113013223011 is an apocalyptic number.
1113013223011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113013223011 is an equidigital number, since it uses as much as digits as its factorization.
1113013223011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1113013223011 its reverse (1103223103111), we get a palindrome (2216236326122).
The spelling of 1113013223011 in words is "one trillion, one hundred thirteen billion, thirteen million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •