Base | Representation |
---|---|
bin | 1011101100011111001… |
… | …1010001010110101111 |
3 | 201012121111120010001221 |
4 | 2323013303101112233 |
5 | 11242441133231111 |
6 | 232145053444211 |
7 | 20341666636642 |
oct | 2730763212657 |
9 | 635544503057 |
10 | 200920602031 |
11 | 78234495126 |
12 | 32b33aa0667 |
13 | 15c3cc79cc6 |
14 | 9a20481a59 |
15 | 535e1c0371 |
hex | 2ec7cd15af |
200920602031 has 4 divisors (see below), whose sum is σ = 212739460992. Its totient is φ = 189101743072.
The previous prime is 200920601993. The next prime is 200920602037. The reversal of 200920602031 is 130206029002.
It is a happy number.
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 200920602031 - 221 = 200918504879 is a prime.
It is a super-2 number, since 2×2009206020312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200920601987 and 200920602005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200920602037) 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, 5909429455 + ... + 5909429488.
It is an arithmetic number, because the mean of its divisors is an integer number (53184865248).
Almost surely, 2200920602031 is an apocalyptic number.
200920602031 is a deficient number, since it is larger than the sum of its proper divisors (11818858961).
200920602031 is a wasteful number, since it uses less digits than its factorization.
200920602031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11818858960.
The product of its (nonzero) digits is 1296, while the sum is 25.
The spelling of 200920602031 in words is "two hundred billion, nine hundred twenty million, six hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •