Base | Representation |
---|---|
bin | 1011101001000011101… |
… | …1111101001110111111 |
3 | 201010020100112101121110 |
4 | 2322100323331032333 |
5 | 11234100013211111 |
6 | 231513452533103 |
7 | 20310122033640 |
oct | 2722073751677 |
9 | 633210471543 |
10 | 200000132031 |
11 | 77901951417 |
12 | 32917781193 |
13 | 15b243672bb |
14 | 99741176c7 |
15 | 530849d5a6 |
hex | 2e90efd3bf |
200000132031 has 16 divisors (see below), whose sum is σ = 305723510784. Its totient is φ = 113925262944.
The previous prime is 200000132009. The next prime is 200000132047. The reversal of 200000132031 is 130231000002.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-200000132031 is a prime.
It is a super-2 number, since 2×2000001320312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200000131998 and 200000132016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200000132071) 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, 15015135 + ... + 15028448.
It is an arithmetic number, because the mean of its divisors is an integer number (19107719424).
Almost surely, 2200000132031 is an apocalyptic number.
200000132031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200000132031 is a deficient number, since it is larger than the sum of its proper divisors (105723378753).
200000132031 is a wasteful number, since it uses less digits than its factorization.
200000132031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30043910.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 200000132031 its reverse (130231000002), we get a palindrome (330231132033).
The spelling of 200000132031 in words is "two hundred billion, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •