Base | Representation |
---|---|
bin | 1011101001011110101… |
… | …0100110100000110111 |
3 | 201010112012221211221121 |
4 | 2322113222212200313 |
5 | 11234312413214111 |
6 | 231533004324411 |
7 | 20312662426135 |
oct | 2722752464067 |
9 | 633465854847 |
10 | 200113023031 |
11 | 7795a648069 |
12 | 32949543707 |
13 | 15b418724cc |
14 | 9985102755 |
15 | 531334c871 |
hex | 2e97aa6837 |
200113023031 has 8 divisors (see below), whose sum is σ = 200439730800. Its totient is φ = 199786441920.
The previous prime is 200113022983. The next prime is 200113023041. The reversal of 200113023031 is 130320311002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200113023031 - 215 = 200112990263 is a prime.
It is a super-2 number, since 2×2001130230312 (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 = 200113022996 and 200113023014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200113023041) 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, 3437436 + ... + 3495166.
It is an arithmetic number, because the mean of its divisors is an integer number (25054966350).
Almost surely, 2200113023031 is an apocalyptic number.
200113023031 is a deficient number, since it is larger than the sum of its proper divisors (326707769).
200113023031 is an equidigital number, since it uses as much as digits as its factorization.
200113023031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63329.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 200113023031 its reverse (130320311002), we get a palindrome (330433334033).
The spelling of 200113023031 in words is "two hundred billion, one hundred thirteen million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •