Base | Representation |
---|---|
bin | 1010010011101011100100… |
… | …1001011111100001101001 |
3 | 1111010110001021200121202220 |
4 | 2210322321021133201221 |
5 | 2441140423340001413 |
6 | 40034225230544253 |
7 | 2246541001354101 |
oct | 244727111374151 |
9 | 44113037617686 |
10 | 11333230000233 |
11 | 367a439973219 |
12 | 1330557968089 |
13 | 64294685b69b |
14 | 2b2761aba201 |
15 | 149c0b319223 |
hex | a4eb925f869 |
11333230000233 has 8 divisors (see below), whose sum is σ = 15999854118048. Its totient is φ = 7111046274624.
The previous prime is 11333230000219. The next prime is 11333230000243. The reversal of 11333230000233 is 33200003233311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11333230000233 - 210 = 11333229999209 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11333230000243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111110097991 + ... + 111110098092.
It is an arithmetic number, because the mean of its divisors is an integer number (1999981764756).
Almost surely, 211333230000233 is an apocalyptic number.
It is an amenable number.
11333230000233 is a deficient number, since it is larger than the sum of its proper divisors (4666624117815).
11333230000233 is a wasteful number, since it uses less digits than its factorization.
11333230000233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222220196103.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 11333230000233 its reverse (33200003233311), we get a palindrome (44533233233544).
The spelling of 11333230000233 in words is "eleven trillion, three hundred thirty-three billion, two hundred thirty million, two hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •