Base | Representation |
---|---|
bin | 1010000001000111111101… |
… | …1011110010000111001011 |
3 | 1102222222011212000210020102 |
4 | 2200101333123302013023 |
5 | 2420430030114332043 |
6 | 35231543341120015 |
7 | 2214523642261106 |
oct | 240217733620713 |
9 | 42888155023212 |
10 | 11014434136523 |
11 | 3567216a19364 |
12 | 129a80785900b |
13 | 61b86c96723c |
14 | 2a115c57b73d |
15 | 14179d9956b8 |
hex | a047f6f21cb |
11014434136523 has 8 divisors (see below), whose sum is σ = 11594929296720. Its totient is φ = 10434017786400.
The previous prime is 11014434136499. The next prime is 11014434136567. The reversal of 11014434136523 is 32563143441011.
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 11014434136523 - 214 = 11014434120139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11014434196523) 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, 19415528 + ... + 19974773.
It is an arithmetic number, because the mean of its divisors is an integer number (1449366162090).
Almost surely, 211014434136523 is an apocalyptic number.
11014434136523 is a deficient number, since it is larger than the sum of its proper divisors (580495160197).
11014434136523 is a wasteful number, since it uses less digits than its factorization.
11014434136523 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39405037.
The product of its (nonzero) digits is 103680, while the sum is 38.
Adding to 11014434136523 its reverse (32563143441011), we get a palindrome (43577577577534).
The spelling of 11014434136523 in words is "eleven trillion, fourteen billion, four hundred thirty-four million, one hundred thirty-six thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •