Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1100101110000010101 |
3 | 201010020111022001102220 |
4 | 2322101003211300111 |
5 | 11234101021224023 |
6 | 231514003452553 |
7 | 20310145036464 |
oct | 2722103456025 |
9 | 633214261386 |
10 | 200002133013 |
11 | 77902a98821 |
12 | 32918387159 |
13 | 15b248b8007 |
14 | 99744b89db |
15 | 53087463e3 |
hex | 2e910e5c15 |
200002133013 has 16 divisors (see below), whose sum is σ = 268369744320. Its totient is φ = 132485030784.
The previous prime is 200002132963. The next prime is 200002133047. The reversal of 200002133013 is 310331200002.
It is not a de Polignac number, because 200002133013 - 224 = 199985355797 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200002132983 and 200002133001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200002135013) 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 15 ways as a sum of consecutive naturals, for example, 2091633 + ... + 2185161.
It is an arithmetic number, because the mean of its divisors is an integer number (16773109020).
Almost surely, 2200002133013 is an apocalyptic number.
It is an amenable number.
200002133013 is a deficient number, since it is larger than the sum of its proper divisors (68367611307).
200002133013 is a wasteful number, since it uses less digits than its factorization.
200002133013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98068.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 200002133013 its reverse (310331200002), we get a palindrome (510333333015).
The spelling of 200002133013 in words is "two hundred billion, two million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •