Base | Representation |
---|---|
bin | 1011101001011110110… |
… | …0111110100110111101 |
3 | 201010112021010111112000 |
4 | 2322113230332212331 |
5 | 11234313043133023 |
6 | 231533025532513 |
7 | 20313000632331 |
oct | 2722754764675 |
9 | 633467114460 |
10 | 200113646013 |
11 | 7795aa33126 |
12 | 329497a4139 |
13 | 15b41a2cc38 |
14 | 99852257c1 |
15 | 5313422243 |
hex | 2e97b3e9bd |
200113646013 has 16 divisors (see below), whose sum is σ = 296766291840. Its totient is φ = 133273363392.
The previous prime is 200113645999. The next prime is 200113646053. The reversal of 200113646013 is 310646311002.
200113646013 is a `hidden beast` number, since 2 + 0 + 0 + 1 + 1 + 3 + 646 + 0 + 13 = 666.
It is not a de Polignac number, because 200113646013 - 28 = 200113645757 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200113646053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3743356 + ... + 3796437.
It is an arithmetic number, because the mean of its divisors is an integer number (18547893240).
Almost surely, 2200113646013 is an apocalyptic number.
It is an amenable number.
200113646013 is a deficient number, since it is larger than the sum of its proper divisors (96652645827).
200113646013 is an equidigital number, since it uses as much as digits as its factorization.
200113646013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7540785 (or 7540779 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 200113646013 its reverse (310646311002), we get a palindrome (510759957015).
The spelling of 200113646013 in words is "two hundred billion, one hundred thirteen million, six hundred forty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •