Base | Representation |
---|---|
bin | 11100000000110011001000… |
… | …001010110100111110101111 |
3 | 121011012211020210001012210220 |
4 | 130000303020022310332233 |
5 | 112122003002222400421 |
6 | 1114005220213302423 |
7 | 34643630545105116 |
oct | 3400631012647657 |
9 | 534184223035726 |
10 | 123200200200111 |
11 | 36289a03210421 |
12 | 11999035934a13 |
13 | 53989628a3138 |
14 | 225ccc887cc7d |
15 | e39abebb73c6 |
hex | 700cc82b4faf |
123200200200111 has 4 divisors (see below), whose sum is σ = 164266933600152. Its totient is φ = 82133466800072.
The previous prime is 123200200200089. The next prime is 123200200200131. The reversal of 123200200200111 is 111002002002321.
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 123200200200111 - 25 = 123200200200079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123200200200131) 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, 20533366700016 + ... + 20533366700021.
It is an arithmetic number, because the mean of its divisors is an integer number (41066733400038).
Almost surely, 2123200200200111 is an apocalyptic number.
123200200200111 is a deficient number, since it is larger than the sum of its proper divisors (41066733400041).
123200200200111 is an equidigital number, since it uses as much as digits as its factorization.
123200200200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41066733400040.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 123200200200111 its reverse (111002002002321), we get a palindrome (234202202202432).
The spelling of 123200200200111 in words is "one hundred twenty-three trillion, two hundred billion, two hundred million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •