Base | Representation |
---|---|
bin | 1010011000011000111011… |
… | …0011100111111110100000 |
3 | 1111102011211221000202100001 |
4 | 2212012032303213332200 |
5 | 2444002111221100412 |
6 | 40135324242105344 |
7 | 2255433430136326 |
oct | 246061663477640 |
9 | 44364757022301 |
10 | 11414124003232 |
11 | 3700780485a55 |
12 | 134417304b254 |
13 | 64a468c6a352 |
14 | 2b663748dd16 |
15 | 14bd9302c957 |
hex | a618ece7fa0 |
11414124003232 has 96 divisors (see below), whose sum is σ = 22820750447040. Its totient is φ = 5618878679040.
The previous prime is 11414124003193. The next prime is 11414124003263. The reversal of 11414124003232 is 23230042141411.
It is a happy number.
It is a super-2 number, since 2×114141240032322 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11414124003232.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1364831883 + ... + 1364840245.
It is an arithmetic number, because the mean of its divisors is an integer number (237716150490).
Almost surely, 211414124003232 is an apocalyptic number.
It is an amenable number.
11414124003232 is a deficient number, since it is larger than the sum of its proper divisors (11406626443808).
11414124003232 is a wasteful number, since it uses less digits than its factorization.
11414124003232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10166 (or 10158 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 11414124003232 its reverse (23230042141411), we get a palindrome (34644166144643).
The spelling of 11414124003232 in words is "eleven trillion, four hundred fourteen billion, one hundred twenty-four million, three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •