Base | Representation |
---|---|
bin | 11010001001111100000110… |
… | …110111010010000100101011 |
3 | 120002021222021111021010002012 |
4 | 122021330012313102010223 |
5 | 110034141443401302021 |
6 | 1044353024013430135 |
7 | 33141542516033204 |
oct | 3211740667220453 |
9 | 502258244233065 |
10 | 115032224244011 |
11 | 3371a98a77a178 |
12 | 10a9a02319b34b |
13 | 4c2565249a219 |
14 | 20598372c05ab |
15 | d473bae6835b |
hex | 689f06dd212b |
115032224244011 has 2 divisors, whose sum is σ = 115032224244012. Its totient is φ = 115032224244010.
The previous prime is 115032224243957. The next prime is 115032224244031. The reversal of 115032224244011 is 110442422230511.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115032224244011 is a prime.
It is a super-2 number, since 2×1150322242440112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (115032224244031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57516112122005 + 57516112122006.
It is an arithmetic number, because the mean of its divisors is an integer number (57516112122006).
Almost surely, 2115032224244011 is an apocalyptic number.
115032224244011 is a deficient number, since it is larger than the sum of its proper divisors (1).
115032224244011 is an equidigital number, since it uses as much as digits as its factorization.
115032224244011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 115032224244011 its reverse (110442422230511), we get a palindrome (225474646474522).
The spelling of 115032224244011 in words is "one hundred fifteen trillion, thirty-two billion, two hundred twenty-four million, two hundred forty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •