Base | Representation |
---|---|
bin | 11001111110011011011010… |
… | …110011101100100110000101 |
3 | 112222111100112102112011222022 |
4 | 121332123122303230212011 |
5 | 104433212000021432401 |
6 | 1042545404325212525 |
7 | 33030440465326565 |
oct | 3176333263544605 |
9 | 488440472464868 |
10 | 114241211124101 |
11 | 33445475465506 |
12 | 10990866561145 |
13 | 4b98b91359199 |
14 | 202d438716da5 |
15 | d31a21b1071b |
hex | 67e6dacec985 |
114241211124101 has 2 divisors, whose sum is σ = 114241211124102. Its totient is φ = 114241211124100.
The previous prime is 114241211124077. The next prime is 114241211124119. The reversal of 114241211124101 is 101421112142411.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108138577060900 + 6102634063201 = 10398970^2 + 2470351^2 .
It is a cyclic number.
It is not a de Polignac number, because 114241211124101 - 26 = 114241211124037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114241211424101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57120605562050 + 57120605562051.
It is an arithmetic number, because the mean of its divisors is an integer number (57120605562051).
Almost surely, 2114241211124101 is an apocalyptic number.
It is an amenable number.
114241211124101 is a deficient number, since it is larger than the sum of its proper divisors (1).
114241211124101 is an equidigital number, since it uses as much as digits as its factorization.
114241211124101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 26.
Adding to 114241211124101 its reverse (101421112142411), we get a palindrome (215662323266512).
The spelling of 114241211124101 in words is "one hundred fourteen trillion, two hundred forty-one billion, two hundred eleven million, one hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •