Base | Representation |
---|---|
bin | 11001111111111000101110… |
… | …100011000111110011010001 |
3 | 112222211221010210011022122210 |
4 | 121333320232203013303101 |
5 | 104441332141440004131 |
6 | 1043103414131222333 |
7 | 33040615330354416 |
oct | 3177705643076321 |
9 | 488757123138583 |
10 | 114341400313041 |
11 | 33483a0866a000 |
12 | 109a81677479a9 |
13 | 4ba546a109135 |
14 | 203422094410d |
15 | d3443776b146 |
hex | 67fe2e8c7cd1 |
114341400313041 has 16 divisors (see below), whose sum is σ = 167689266280128. Its totient is φ = 69297818369120.
The previous prime is 114341400313003. The next prime is 114341400313057. The reversal of 114341400313041 is 140313004143411.
It is not a de Polignac number, because 114341400313041 - 218 = 114341400050897 is a prime.
It is not an unprimeable number, because it can be changed into a prime (114341400313001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14317727076 + ... + 14317735061.
It is an arithmetic number, because the mean of its divisors is an integer number (10480579142508).
Almost surely, 2114341400313041 is an apocalyptic number.
114341400313041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114341400313041 is a deficient number, since it is larger than the sum of its proper divisors (53347865967087).
114341400313041 is an equidigital number, since it uses as much as digits as its factorization.
114341400313041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28635462173 (or 28635462151 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 114341400313041 its reverse (140313004143411), we get a palindrome (254654404456452).
The spelling of 114341400313041 in words is "one hundred fourteen trillion, three hundred forty-one billion, four hundred million, three hundred thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •