Base | Representation |
---|---|
bin | 10100111011000111… |
… | …10101010110001101 |
3 | 1001222212112100201000 |
4 | 22131203311112031 |
5 | 141001214213203 |
6 | 5054401410513 |
7 | 545241623421 |
oct | 123543652615 |
9 | 31885470630 |
10 | 11233351053 |
11 | 4844a2aa01 |
12 | 2216039a39 |
13 | 10a038acb2 |
14 | 787c94b81 |
15 | 45b2d54a3 |
hex | 29d8f558d |
11233351053 has 32 divisors (see below), whose sum is σ = 17273984000. Its totient is φ = 7207185600.
The previous prime is 11233351049. The next prime is 11233351067. The reversal of 11233351053 is 35015333211.
11233351053 is a `hidden beast` number, since 112 + 3 + 33 + 510 + 5 + 3 = 666.
It is not a de Polignac number, because 11233351053 - 22 = 11233351049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11233351013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 114423 + ... + 188571.
It is an arithmetic number, because the mean of its divisors is an integer number (539812000).
Almost surely, 211233351053 is an apocalyptic number.
It is an amenable number.
11233351053 is a deficient number, since it is larger than the sum of its proper divisors (6040632947).
11233351053 is a wasteful number, since it uses less digits than its factorization.
11233351053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74370 (or 74364 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 11233351053 its reverse (35015333211), we get a palindrome (46248684264).
The spelling of 11233351053 in words is "eleven billion, two hundred thirty-three million, three hundred fifty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •