Base | Representation |
---|---|
bin | 1101100101000111000… |
… | …0111100101100111111 |
3 | 211022012002010222022122 |
4 | 3121101300330230333 |
5 | 12310244301120111 |
6 | 255102045033155 |
7 | 22566251310341 |
oct | 3312160745477 |
9 | 738162128278 |
10 | 233300020031 |
11 | 8aa3a863111 |
12 | 3926b8557bb |
13 | 190002a2740 |
14 | b41290d291 |
15 | 6106b56cdb |
hex | 3651c3cb3f |
233300020031 has 8 divisors (see below), whose sum is σ = 257374131504. Its totient is φ = 210101330880.
The previous prime is 233300019919. The next prime is 233300020067. The reversal of 233300020031 is 130020003332.
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 233300020031 - 234 = 216120150847 is a prime.
It is a super-2 number, since 2×2333000200312 (a number of 24 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 = 233300019991 and 233300020009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (233300022031) 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, 218855021 + ... + 218856086.
It is an arithmetic number, because the mean of its divisors is an integer number (32171766438).
Almost surely, 2233300020031 is an apocalyptic number.
233300020031 is a deficient number, since it is larger than the sum of its proper divisors (24074111473).
233300020031 is a wasteful number, since it uses less digits than its factorization.
233300020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 437711161.
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 233300020031 its reverse (130020003332), we get a palindrome (363320023363).
The spelling of 233300020031 in words is "two hundred thirty-three billion, three hundred million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.238 sec. • engine limits •