Base | Representation |
---|---|
bin | 1011000000111110000111… |
… | …0010111110100001110111 |
3 | 1120212211101101121222111001 |
4 | 2300033201302332201313 |
5 | 3041412421031404333 |
6 | 41431504353424131 |
7 | 2360004221203114 |
oct | 260174162764167 |
9 | 46784341558431 |
10 | 12111301044343 |
11 | 394a412775876 |
12 | 143730226b047 |
13 | 69b1245cbbc7 |
14 | 2dc2938b590b |
15 | 160099362b7d |
hex | b03e1cbe877 |
12111301044343 has 4 divisors (see below), whose sum is σ = 12292066731640. Its totient is φ = 11930535357048.
The previous prime is 12111301044317. The next prime is 12111301044377. The reversal of 12111301044343 is 34344010311121.
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 12111301044343 - 213 = 12111301036151 is a prime.
It is a super-2 number, since 2×121113010443432 (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 (12111301044443) 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, 90382843548 + ... + 90382843681.
It is an arithmetic number, because the mean of its divisors is an integer number (3073016682910).
Almost surely, 212111301044343 is an apocalyptic number.
12111301044343 is a deficient number, since it is larger than the sum of its proper divisors (180765687297).
12111301044343 is an equidigital number, since it uses as much as digits as its factorization.
12111301044343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180765687296.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 12111301044343 its reverse (34344010311121), we get a palindrome (46455311355464).
The spelling of 12111301044343 in words is "twelve trillion, one hundred eleven billion, three hundred one million, forty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •