Base | Representation |
---|---|
bin | 10100111011000111… |
… | …10000111100000101 |
3 | 1001222212111102221021 |
4 | 22131203300330011 |
5 | 141001213123442 |
6 | 5054401151141 |
7 | 545241516655 |
oct | 123543607405 |
9 | 31885442837 |
10 | 11233332997 |
11 | 4844a18387 |
12 | 221602b4b1 |
13 | 10a0382a03 |
14 | 787c8c365 |
15 | 45b2cee67 |
hex | 29d8f0f05 |
11233332997 has 2 divisors, whose sum is σ = 11233332998. Its totient is φ = 11233332996.
The previous prime is 11233332983. The next prime is 11233333037. The reversal of 11233332997 is 79923333211.
11233332997 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10916279361 + 317053636 = 104481^2 + 17806^2 .
It is an emirp because it is prime and its reverse (79923333211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11233332997 - 211 = 11233330949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11233332977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5616666498 + 5616666499.
It is an arithmetic number, because the mean of its divisors is an integer number (5616666499).
Almost surely, 211233332997 is an apocalyptic number.
It is an amenable number.
11233332997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11233332997 is an equidigital number, since it uses as much as digits as its factorization.
11233332997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 183708, while the sum is 43.
The spelling of 11233332997 in words is "eleven billion, two hundred thirty-three million, three hundred thirty-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •