Base | Representation |
---|---|
bin | 1010111011001001101101… |
… | …0100100111111001111111 |
3 | 1120112021100112211000211021 |
4 | 2232302123110213321333 |
5 | 3033243203103400211 |
6 | 41313533022205011 |
7 | 2346535031062603 |
oct | 256623324477177 |
9 | 46467315730737 |
10 | 12011334434431 |
11 | 3910a84176192 |
12 | 141ba63723767 |
13 | 6918829b0517 |
14 | 2d74cd067503 |
15 | 15c698021771 |
hex | aec9b527e7f |
12011334434431 has 8 divisors (see below), whose sum is σ = 12667777714800. Its totient is φ = 11357317932480.
The previous prime is 12011334434383. The next prime is 12011334434471. The reversal of 12011334434431 is 13443443311021.
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 12011334434431 - 29 = 12011334433919 is a prime.
It is a super-2 number, since 2×120113344344312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011334434471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 606684436 + ... + 606704233.
It is an arithmetic number, because the mean of its divisors is an integer number (1583472214350).
Almost surely, 212011334434431 is an apocalyptic number.
12011334434431 is a deficient number, since it is larger than the sum of its proper divisors (656443280369).
12011334434431 is a wasteful number, since it uses less digits than its factorization.
12011334434431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1213389209.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 12011334434431 its reverse (13443443311021), we get a palindrome (25454777745452).
The spelling of 12011334434431 in words is "twelve trillion, eleven billion, three hundred thirty-four million, four hundred thirty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •