Base | Representation |
---|---|
bin | 1011001110100001000001… |
… | …0110011111011100001111 |
3 | 1121201002001022020001110021 |
4 | 2303220100112133130033 |
5 | 3104221013121340421 |
6 | 42130432101323011 |
7 | 2412553040446342 |
oct | 263502026373417 |
9 | 47632038201407 |
10 | 12344010340111 |
11 | 3a2a07a03600a |
12 | 1474428106467 |
13 | 6b705c3a2a58 |
14 | 30964bb74459 |
15 | 1661691d0341 |
hex | b3a1059f70f |
12344010340111 has 4 divisors (see below), whose sum is σ = 12344030209224. Its totient is φ = 12343990471000.
The previous prime is 12344010340061. The next prime is 12344010340127. The reversal of 12344010340111 is 11104301044321.
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 12344010340111 - 233 = 12335420405519 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12344010344111) 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 3 ways as a sum of consecutive naturals, for example, 8971540 + ... + 10255561.
It is an arithmetic number, because the mean of its divisors is an integer number (3086007552306).
Almost surely, 212344010340111 is an apocalyptic number.
12344010340111 is a deficient number, since it is larger than the sum of its proper divisors (19869113).
12344010340111 is an equidigital number, since it uses as much as digits as its factorization.
12344010340111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19869112.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 12344010340111 its reverse (11104301044321), we get a palindrome (23448311384432).
The spelling of 12344010340111 in words is "twelve trillion, three hundred forty-four billion, ten million, three hundred forty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •