Base | Representation |
---|---|
bin | 10100111011000110… |
… | …00001110111110101 |
3 | 1001222212010122111010 |
4 | 22131203001313311 |
5 | 141001140441323 |
6 | 5054353102433 |
7 | 545240054631 |
oct | 123543016765 |
9 | 31885118433 |
10 | 11233140213 |
11 | 48448a6559 |
12 | 2215b57a19 |
13 | 10a0316039 |
14 | 787c3bdc1 |
15 | 45b292c93 |
hex | 29d8c1df5 |
11233140213 has 16 divisors (see below), whose sum is σ = 15239255040. Its totient is φ = 7358024304.
The previous prime is 11233140211. The next prime is 11233140241. The reversal of 11233140213 is 31204133211.
It is not a de Polignac number, because 11233140213 - 21 = 11233140211 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11233140213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11233140211) 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 15 ways as a sum of consecutive naturals, for example, 349770 + ... + 380532.
It is an arithmetic number, because the mean of its divisors is an integer number (952453440).
Almost surely, 211233140213 is an apocalyptic number.
It is an amenable number.
11233140213 is a deficient number, since it is larger than the sum of its proper divisors (4006114827).
11233140213 is a wasteful number, since it uses less digits than its factorization.
11233140213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32888.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 11233140213 its reverse (31204133211), we get a palindrome (42437273424).
The spelling of 11233140213 in words is "eleven billion, two hundred thirty-three million, one hundred forty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •