Base | Representation |
---|---|
bin | 11001111111101111000011… |
… | …011111010111000111100111 |
3 | 112222210221022221220122212011 |
4 | 121333233003133113013213 |
5 | 104441144404120334003 |
6 | 1043054535353335051 |
7 | 33040100054204410 |
oct | 3177570337270747 |
9 | 488727287818764 |
10 | 114331014230503 |
11 | 3347a568a25514 |
12 | 109a6149407487 |
13 | 4ba44a3441075 |
14 | 2033917400807 |
15 | d3402aa4846d |
hex | 67fbc37d71e7 |
114331014230503 has 16 divisors (see below), whose sum is σ = 134248543752960. Its totient is φ = 95343863659776.
The previous prime is 114331014230449. The next prime is 114331014230557. The reversal of 114331014230503 is 305032410133411.
It is an interprime number because it is at equal distance from previous prime (114331014230449) and next prime (114331014230557).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114331014230503 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114331014230603) 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, 1426921501 + ... + 1427001622.
It is an arithmetic number, because the mean of its divisors is an integer number (8390533984560).
Almost surely, 2114331014230503 is an apocalyptic number.
114331014230503 is a deficient number, since it is larger than the sum of its proper divisors (19917529522457).
114331014230503 is an equidigital number, since it uses as much as digits as its factorization.
114331014230503 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2853923286.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 114331014230503 its reverse (305032410133411), we get a palindrome (419363424363914).
The spelling of 114331014230503 in words is "one hundred fourteen trillion, three hundred thirty-one billion, fourteen million, two hundred thirty thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •