Base | Representation |
---|---|
bin | 11001111011010001100111… |
… | …000001100111111001010011 |
3 | 112221201122012212102101201011 |
4 | 121323101213001213321103 |
5 | 104421134204141044021 |
6 | 1042302050315551351 |
7 | 33005666623322044 |
oct | 3173214701477123 |
9 | 487648185371634 |
10 | 114024520253011 |
11 | 33371589084875 |
12 | 1095687115b557 |
13 | 4b8160a0bc934 |
14 | 2022b5da248cb |
15 | d2b08d1c7de1 |
hex | 67b467067e53 |
114024520253011 has 4 divisors (see below), whose sum is σ = 114024549289024. Its totient is φ = 114024491217000.
The previous prime is 114024520252999. The next prime is 114024520253069. The reversal of 114024520253011 is 110352025420411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114024520253011 - 225 = 114024486698579 is a prime.
It is a super-2 number, since 2×1140245202530112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114024520253911) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7495080 + ... + 16858981.
It is an arithmetic number, because the mean of its divisors is an integer number (28506137322256).
Almost surely, 2114024520253011 is an apocalyptic number.
114024520253011 is a deficient number, since it is larger than the sum of its proper divisors (29036013).
114024520253011 is an equidigital number, since it uses as much as digits as its factorization.
114024520253011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29036012.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 114024520253011 its reverse (110352025420411), we get a palindrome (224376545673422).
The spelling of 114024520253011 in words is "one hundred fourteen trillion, twenty-four billion, five hundred twenty million, two hundred fifty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •