Base | Representation |
---|---|
bin | 10110110010000110100111… |
… | …011100000100000101011111 |
3 | 111010210000222100000201101112 |
4 | 112302012213130010011133 |
5 | 101113134301401401343 |
6 | 553035142505532235 |
7 | 30051134626240523 |
oct | 2662064734040537 |
9 | 433700870021345 |
10 | 100200101200223 |
11 | 29a21695a09622 |
12 | b2a354b1a407b |
13 | 43baaa1408cbb |
14 | 1aa59d4517d83 |
15 | b8b67ba84218 |
hex | 5b21a770415f |
100200101200223 has 2 divisors, whose sum is σ = 100200101200224. Its totient is φ = 100200101200222.
The previous prime is 100200101200201. The next prime is 100200101200247. The reversal of 100200101200223 is 322002101002001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100200101200223 - 210 = 100200101199199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100200101200198 and 100200101200207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100200101100223) 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 as a sum of consecutive naturals, namely, 50100050600111 + 50100050600112.
It is an arithmetic number, because the mean of its divisors is an integer number (50100050600112).
Almost surely, 2100200101200223 is an apocalyptic number.
100200101200223 is a deficient number, since it is larger than the sum of its proper divisors (1).
100200101200223 is an equidigital number, since it uses as much as digits as its factorization.
100200101200223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 100200101200223 its reverse (322002101002001), we get a palindrome (422202202202224).
The spelling of 100200101200223 in words is "one hundred trillion, two hundred billion, one hundred one million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •