Base | Representation |
---|---|

bin | 1011001101001111110010… |

… | …0010001011001010110011 |

3 | 1121121222202111220111211211 |

4 | 2303103330202023022303 |

5 | 3103341332433201003 |

6 | 42112424131020551 |

7 | 2411151451345420 |

oct | 263237442131263 |

9 | 47558674814754 |

10 | 12322203022003 |

11 | 3a208a9404166 |

12 | 1470160a3a757 |

13 | 6b4c95445124 |

14 | 30857d82cd47 |

15 | 1657de96296d |

hex | b34fc88b2b3 |

12322203022003 has 4 divisors (see below), whose sum is σ = 14082517739440. Its totient is φ = 10561888304568.

The previous prime is 12322203021979. The next prime is 12322203022057. The reversal of 12322203022003 is 30022030222321.

Adding to 12322203022003 its reverse (30022030222321), we get a palindrome (42344233244324).

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 12322203022003 - 2^{21} = 12322200924851 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (12322293022003) 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, 880157358708 + ... + 880157358721.

It is an arithmetic number, because the mean of its divisors is an integer number (3520629434860).

Almost surely, 2^{12322203022003} is an apocalyptic number.

12322203022003 is a deficient number, since it is larger than the sum of its proper divisors (1760314717437).

12322203022003 is an equidigital number, since it uses as much as digits as its factorization.

12322203022003 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 1760314717436.

The product of its (nonzero) digits is 1728, while the sum is 22.

The spelling of 12322203022003 in words is "twelve trillion, three hundred twenty-two billion, two hundred three million, twenty-two thousand, three".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •