Base | Representation |
---|---|
bin | 1011101010010000000… |
… | …0100111110100001011 |
3 | 201011001122122120111100 |
4 | 2322210000213310023 |
5 | 11240223422401443 |
6 | 232005323232443 |
7 | 20321055641442 |
oct | 2724400476413 |
9 | 634048576440 |
10 | 200320122123 |
11 | 77a56539740 |
12 | 329a6978723 |
13 | 15b75743b54 |
14 | 99a4811d59 |
15 | 532660a3d3 |
hex | 2ea4027d0b |
200320122123 has 48 divisors (see below), whose sum is σ = 320555005056. Its totient is φ = 119524014720.
The previous prime is 200320122109. The next prime is 200320122127. The reversal of 200320122123 is 321221023002.
200320122123 is a `hidden beast` number, since 200 + 320 + 1 + 22 + 123 = 666.
It is not a de Polignac number, because 200320122123 - 25 = 200320122091 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200320122096 and 200320122105.
It is not an unprimeable number, because it can be changed into a prime (200320122127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12681036 + ... + 12696822.
It is an arithmetic number, because the mean of its divisors is an integer number (6678229272).
Almost surely, 2200320122123 is an apocalyptic number.
200320122123 is a deficient number, since it is larger than the sum of its proper divisors (120234882933).
200320122123 is a wasteful number, since it uses less digits than its factorization.
200320122123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17784 (or 17781 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 200320122123 its reverse (321221023002), we get a palindrome (521541145125).
The spelling of 200320122123 in words is "two hundred billion, three hundred twenty million, one hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •