Base | Representation |
---|---|
bin | 110101010101100111… |
… | …1111111011000100011 |
3 | 101221122122102221200121 |
4 | 1222223033333120203 |
5 | 3334040303323121 |
6 | 124341525501111 |
7 | 11163315010306 |
oct | 1525317773043 |
9 | 357578387617 |
10 | 114542245411 |
11 | 44639125340 |
12 | 1a247b71797 |
13 | aa55575299 |
14 | 5788568b3d |
15 | 2ea5c7d141 |
hex | 1aab3ff623 |
114542245411 has 8 divisors (see below), whose sum is σ = 124969030848. Its totient is φ = 104117769000.
The previous prime is 114542245387. The next prime is 114542245459.
114542245411 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114542245411 - 25 = 114542245379 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114542245471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 472705 + ... + 672706.
It is an arithmetic number, because the mean of its divisors is an integer number (15621128856).
Almost surely, 2114542245411 is an apocalyptic number.
114542245411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
114542245411 is a deficient number, since it is larger than the sum of its proper divisors (10426785437).
114542245411 is a wasteful number, since it uses less digits than its factorization.
114542245411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1154513.
The product of its digits is 25600, while the sum is 34.
It can be divided in two parts, 114542 and 245411, that added together give a palindrome (359953).
The spelling of 114542245411 in words is "one hundred fourteen billion, five hundred forty-two million, two hundred forty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •