Base | Representation |
---|---|
bin | 1011101001111011010… |
… | …0010110101001111111 |
3 | 201010211120202022212221 |
4 | 2322132310112221333 |
5 | 11240034123120111 |
6 | 231552532310211 |
7 | 20315650405462 |
oct | 2723664265177 |
9 | 633746668787 |
10 | 200233020031 |
11 | 77a11357640 |
12 | 32981772367 |
13 | 15b60697c55 |
14 | 999701b2d9 |
15 | 531db52371 |
hex | 2e9ed16a7f |
200233020031 has 32 divisors (see below), whose sum is σ = 233270157312. Its totient is φ = 169853967360.
The previous prime is 200233020011. The next prime is 200233020137. The reversal of 200233020031 is 130020332002.
It is not a de Polignac number, because 200233020031 - 223 = 200224631423 is a prime.
It is a super-2 number, since 2×2002330200312 (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 = 200233019987 and 200233020014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200233020011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 56449600 + ... + 56453146.
It is an arithmetic number, because the mean of its divisors is an integer number (7289692416).
Almost surely, 2200233020031 is an apocalyptic number.
200233020031 is a deficient number, since it is larger than the sum of its proper divisors (33037137281).
200233020031 is a wasteful number, since it uses less digits than its factorization.
200233020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6079.
The product of its (nonzero) digits is 216, while the sum is 16.
Adding to 200233020031 its reverse (130020332002), we get a palindrome (330253352033).
It can be divided in two parts, 2002 and 33020031, that added together give a palindrome (33022033).
The spelling of 200233020031 in words is "two hundred billion, two hundred thirty-three million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •