Base | Representation |
---|---|
bin | 1101100101001110001… |
… | …1110001100110101011 |
3 | 211022021011210021021012 |
4 | 3121103203301212223 |
5 | 12310330002334011 |
6 | 255105042134135 |
7 | 22600065206552 |
oct | 3312343614653 |
9 | 738234707235 |
10 | 233330121131 |
11 | 8aa55852558 |
12 | 3927995134b |
13 | 190065b1743 |
14 | b416906d99 |
15 | 6109600a8b |
hex | 36538f19ab |
233330121131 has 8 divisors (see below), whose sum is σ = 255024952704. Its totient is φ = 212520792960.
The previous prime is 233330121121. The next prime is 233330121137. The reversal of 233330121131 is 131121033332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-233330121131 is a prime.
It is a super-2 number, since 2×2333301211312 (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 = 233330121097 and 233330121106.
It is not an unprimeable number, because it can be changed into a prime (233330121137) 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, 221375300 + ... + 221376353.
It is an arithmetic number, because the mean of its divisors is an integer number (31878119088).
Almost surely, 2233330121131 is an apocalyptic number.
233330121131 is a deficient number, since it is larger than the sum of its proper divisors (21694831573).
233330121131 is a wasteful number, since it uses less digits than its factorization.
233330121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442751701.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 233330121131 its reverse (131121033332), we get a palindrome (364451154463).
The spelling of 233330121131 in words is "two hundred thirty-three billion, three hundred thirty million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •