Base | Representation |
---|---|
bin | 1011010100000111001001… |
… | …0011100110110000001111 |
3 | 1122001021011221211202100201 |
4 | 2311001302103212300033 |
5 | 3112304403104000221 |
6 | 42242531154434331 |
7 | 2422525225031152 |
oct | 265016223466017 |
9 | 48037157752321 |
10 | 12440143031311 |
11 | 3a66920477836 |
12 | 148ab968929a7 |
13 | 6c313c90c498 |
14 | 31016b341c99 |
15 | 1688e3b55891 |
hex | b50724e6c0f |
12440143031311 has 4 divisors (see below), whose sum is σ = 13094887401400. Its totient is φ = 11785398661224.
The previous prime is 12440143031297. The next prime is 12440143031321. The reversal of 12440143031311 is 11313034104421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12440143031311 - 223 = 12440134642703 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12440143031311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12440143031321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 327372185016 + ... + 327372185053.
It is an arithmetic number, because the mean of its divisors is an integer number (3273721850350).
Almost surely, 212440143031311 is an apocalyptic number.
12440143031311 is a deficient number, since it is larger than the sum of its proper divisors (654744370089).
12440143031311 is an equidigital number, since it uses as much as digits as its factorization.
12440143031311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654744370088.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 12440143031311 its reverse (11313034104421), we get a palindrome (23753177135732).
The spelling of 12440143031311 in words is "twelve trillion, four hundred forty billion, one hundred forty-three million, thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •