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

bin | 10110110010011100001010… |

… | …110000011100000001010001 |

3 | 111010212020201002010111122220 |

4 | 112302130022300130001101 |

5 | 101114024200013301001 |

6 | 553053531044251253 |

7 | 30052614242442051 |

oct | 2662341260340121 |

9 | 433766632114586 |

10 | 100223242322001 |

11 | 29a30490526957 |

12 | b2a7b290a0b29 |

13 | 43c001b7a8c76 |

14 | 1aa6b8ba5d561 |

15 | b8c08346cc36 |

hex | 5b270ac1c051 |

100223242322001 has 8 divisors (see below), whose sum is σ = 137242638134784. Its totient is φ = 65009670695280.

The previous prime is 100223242321999. The next prime is 100223242322069.

100223242322001 is nontrivially palindromic in base 10.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 100223242322001 - 2^{1} = 100223242321999 is a prime.

It is not an unprimeable number, because it can be changed into a prime (100223242332001) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 451456046385 + ... + 451456046606.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 902912093031.

The product of its (nonzero) digits is 2304, while the sum is 24.

The spelling of 100223242322001 in words is "one hundred trillion, two hundred twenty-three billion, two hundred forty-two million, three hundred twenty-two thousand, one".

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