Base | Representation |
---|---|
bin | 1011101001011110010… |
… | …0000101000010000111 |
3 | 201010112002201222021021 |
4 | 2322113210011002013 |
5 | 11234311444004111 |
6 | 231532503532011 |
7 | 20312642044540 |
oct | 2722744050207 |
9 | 633462658237 |
10 | 200111313031 |
11 | 7795968a343 |
12 | 32948a5a007 |
13 | 15b413c4086 |
14 | 9984bb94c7 |
15 | 5313110d71 |
hex | 2e97905087 |
200111313031 has 16 divisors (see below), whose sum is σ = 229513927680. Its totient is φ = 170913425760.
The previous prime is 200111313023. The next prime is 200111313037. The reversal of 200111313031 is 130313111002.
It is not a de Polignac number, because 200111313031 - 23 = 200111313023 is a prime.
It is a super-2 number, since 2×2001113130312 (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 = 200111312996 and 200111313014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200111313037) 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, 2661330 + ... + 2735488.
It is an arithmetic number, because the mean of its divisors is an integer number (14344620480).
Almost surely, 2200111313031 is an apocalyptic number.
200111313031 is a deficient number, since it is larger than the sum of its proper divisors (29402614649).
200111313031 is an equidigital number, since it uses as much as digits as its factorization.
200111313031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75534.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 200111313031 its reverse (130313111002), we get a palindrome (330424424033).
The spelling of 200111313031 in words is "two hundred billion, one hundred eleven million, three hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •