Base | Representation |
---|---|
bin | 11001111011000101000011… |
… | …100010100101111100010111 |
3 | 112221200100102101222022022110 |
4 | 121323011003202211330113 |
5 | 104420424102220422403 |
6 | 1042251540531402103 |
7 | 33005011566223011 |
oct | 3173050342457427 |
9 | 487610371868273 |
10 | 114011040014103 |
11 | 333668a090a861 |
12 | 1095412a753333 |
13 | 4b8026c3945cb |
14 | 20222415a91b1 |
15 | d2aa4ea13103 |
hex | 67b1438a5f17 |
114011040014103 has 8 divisors (see below), whose sum is σ = 152251134827008. Its totient is φ = 75889152605304.
The previous prime is 114011040014029. The next prime is 114011040014119. The reversal of 114011040014103 is 301410040110411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114011040014103 - 228 = 114010771578647 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114011040014103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114011040014153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29551848775 + ... + 29551852632.
It is an arithmetic number, because the mean of its divisors is an integer number (19031391853376).
Almost surely, 2114011040014103 is an apocalyptic number.
114011040014103 is a deficient number, since it is larger than the sum of its proper divisors (38240094812905).
114011040014103 is an equidigital number, since it uses as much as digits as its factorization.
114011040014103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59103702053.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 114011040014103 its reverse (301410040110411), we get a palindrome (415421080124514).
The spelling of 114011040014103 in words is "one hundred fourteen trillion, eleven billion, forty million, fourteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •