Base | Representation |
---|---|
bin | 1010010010111010011100… |
… | …0011000001011011110111 |
3 | 1111002012000011000221100202 |
4 | 2210232213003001123313 |
5 | 2440431421100143333 |
6 | 40024204421431115 |
7 | 2245563115252406 |
oct | 244564703013367 |
9 | 44065004027322 |
10 | 11320041412343 |
11 | 367489129aa04 |
12 | 1329a96b6b49b |
13 | 641624399c21 |
14 | 2b1c7029d63d |
15 | 1496d85645e8 |
hex | a4ba70c16f7 |
11320041412343 has 4 divisors (see below), whose sum is σ = 11328729089328. Its totient is φ = 11311353735360.
The previous prime is 11320041412291. The next prime is 11320041412397. The reversal of 11320041412343 is 34321414002311.
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 11320041412343 - 26 = 11320041412279 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 (11320041412543) 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, 4343836538 + ... + 4343839143.
It is an arithmetic number, because the mean of its divisors is an integer number (2832182272332).
Almost surely, 211320041412343 is an apocalyptic number.
11320041412343 is a deficient number, since it is larger than the sum of its proper divisors (8687676985).
11320041412343 is an equidigital number, since it uses as much as digits as its factorization.
11320041412343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8687676984.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 11320041412343 its reverse (34321414002311), we get a palindrome (45641455414654).
The spelling of 11320041412343 in words is "eleven trillion, three hundred twenty billion, forty-one million, four hundred twelve thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •