Base | Representation |
---|---|
bin | 101101100010111101000100… |
… | …000110001110101110100111 |
3 | 222021020211202120222021112220 |
4 | 231202331010012032232213 |
5 | 202223421310240431043 |
6 | 1550011012022243423 |
7 | 60123134454060624 |
oct | 5542750406165647 |
9 | 867224676867486 |
10 | 200314122202023 |
11 | 5890a818893a95 |
12 | 1a572276286573 |
13 | 87a0704b1493b |
14 | 376738056d34b |
15 | 182596b46e483 |
hex | b62f4418eba7 |
200314122202023 has 8 divisors (see below), whose sum is σ = 267101021856768. Its totient is φ = 133534985340984.
The previous prime is 200314122202009. The next prime is 200314122202043. The reversal of 200314122202023 is 320202221413002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200314122202023 - 26 = 200314122201959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200314122201984 and 200314122202002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200314122202043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1940638215 + ... + 1940741432.
It is an arithmetic number, because the mean of its divisors is an integer number (33387627732096).
Almost surely, 2200314122202023 is an apocalyptic number.
200314122202023 is a deficient number, since it is larger than the sum of its proper divisors (66786899654745).
200314122202023 is a wasteful number, since it uses less digits than its factorization.
200314122202023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3881396853.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 200314122202023 its reverse (320202221413002), we get a palindrome (520516343615025).
The spelling of 200314122202023 in words is "two hundred trillion, three hundred fourteen billion, one hundred twenty-two million, two hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •