Base | Representation |
---|---|
bin | 11001111110011010010011… |
… | …100010110101000101011101 |
3 | 112222111020110002210012121101 |
4 | 121332122103202311011131 |
5 | 104433202022433120333 |
6 | 1042545045535233101 |
7 | 33030366040010611 |
oct | 3176322342650535 |
9 | 488436402705541 |
10 | 114240015520093 |
11 | 33444a11591521 |
12 | 10990592078791 |
13 | 4b98a307438a8 |
14 | 202d363a0d341 |
15 | d319a1b9267d |
hex | 67e6938b515d |
114240015520093 has 2 divisors, whose sum is σ = 114240015520094. Its totient is φ = 114240015520092.
The previous prime is 114240015520091. The next prime is 114240015520159. The reversal of 114240015520093 is 390025510042411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95228654039289 + 19011361480804 = 9758517^2 + 4360202^2 .
It is a cyclic number.
It is not a de Polignac number, because 114240015520093 - 21 = 114240015520091 is a prime.
It is a super-2 number, since 2×1142400155200932 (a number of 29 digits) contains 22 as substring.
Together with 114240015520091, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114240015520091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57120007760046 + 57120007760047.
It is an arithmetic number, because the mean of its divisors is an integer number (57120007760047).
Almost surely, 2114240015520093 is an apocalyptic number.
It is an amenable number.
114240015520093 is a deficient number, since it is larger than the sum of its proper divisors (1).
114240015520093 is an equidigital number, since it uses as much as digits as its factorization.
114240015520093 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 114240015520093 in words is "one hundred fourteen trillion, two hundred forty billion, fifteen million, five hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •