Base | Representation |
---|---|
bin | 11010000100000000000000… |
… | …110110010010010011101011 |
3 | 120000211221211201011212010002 |
4 | 122010000000312102103223 |
5 | 110011000124431121121 |
6 | 1043441330225213215 |
7 | 33100214042234213 |
oct | 3204000066222353 |
9 | 500757751155102 |
10 | 114624101426411 |
11 | 33582899013785 |
12 | 10a32b0379120b |
13 | 4bc6011046545 |
14 | 2043b9c403243 |
15 | d3b9813b3e0b |
hex | 684000d924eb |
114624101426411 has 16 divisors (see below), whose sum is σ = 119870296416000. Its totient is φ = 109399868418720.
The previous prime is 114624101426369. The next prime is 114624101426423.
114624101426411 is nontrivially palindromic in base 10.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114624101426411 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114624101426011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59431316 + ... + 61329678.
It is an arithmetic number, because the mean of its divisors is an integer number (7491893526000).
Almost surely, 2114624101426411 is an apocalyptic number.
114624101426411 is a deficient number, since it is larger than the sum of its proper divisors (5246194989589).
114624101426411 is a wasteful number, since it uses less digits than its factorization.
114624101426411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1904146.
The product of its (nonzero) digits is 36864, while the sum is 38.
It can be divided in two parts, 11462410 and 1426411, that added together give a palindrome (12888821).
The spelling of 114624101426411 in words is "one hundred fourteen trillion, six hundred twenty-four billion, one hundred one million, four hundred twenty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •