Base | Representation |
---|---|
bin | 11010000001010101111001… |
… | …101000110000111001110001 |
3 | 120000012111101000122000100202 |
4 | 122001111321220300321301 |
5 | 110000002034222043441 |
6 | 1043221401305524545 |
7 | 33051056450444465 |
oct | 3201257150607161 |
9 | 500174330560322 |
10 | 114441444331121 |
11 | 3351238692a586 |
12 | 10a036281a3755 |
13 | 4bb1a21a8b27b |
14 | 2038dd17824a5 |
15 | d36d4079d19b |
hex | 681579a30e71 |
114441444331121 has 2 divisors, whose sum is σ = 114441444331122. Its totient is φ = 114441444331120.
The previous prime is 114441444331073. The next prime is 114441444331133. The reversal of 114441444331121 is 121133444144411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109484413710400 + 4957030620721 = 10463480^2 + 2226439^2 .
It is a cyclic number.
It is not a de Polignac number, because 114441444331121 - 226 = 114441377222257 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (114441444361121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57220722165560 + 57220722165561.
It is an arithmetic number, because the mean of its divisors is an integer number (57220722165561).
Almost surely, 2114441444331121 is an apocalyptic number.
It is an amenable number.
114441444331121 is a deficient number, since it is larger than the sum of its proper divisors (1).
114441444331121 is an equidigital number, since it uses as much as digits as its factorization.
114441444331121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 73728, while the sum is 38.
Adding to 114441444331121 its reverse (121133444144411), we get a palindrome (235574888475532).
The spelling of 114441444331121 in words is "one hundred fourteen trillion, four hundred forty-one billion, four hundred forty-four million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •