Base | Representation |
---|---|
bin | 10101000110111000… |
… | …01110111100000101 |
3 | 1002020202012100211022 |
4 | 22203130032330011 |
5 | 141201444201041 |
6 | 5112244320525 |
7 | 550550412035 |
oct | 124334167405 |
9 | 32222170738 |
10 | 11332022021 |
11 | 48956a3961 |
12 | 22430a3145 |
13 | 10b7957898 |
14 | 79701b8c5 |
15 | 464cc624b |
hex | 2a370ef05 |
11332022021 has 8 divisors (see below), whose sum is σ = 11618546688. Its totient is φ = 11045980000.
The previous prime is 11332022017. The next prime is 11332022029. The reversal of 11332022021 is 12022023311.
11332022021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11332022021 - 22 = 11332022017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332022029) 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 in 7 ways as a sum of consecutive naturals, for example, 72875 + ... + 167256.
It is an arithmetic number, because the mean of its divisors is an integer number (1452318336).
Almost surely, 211332022021 is an apocalyptic number.
It is an amenable number.
11332022021 is a deficient number, since it is larger than the sum of its proper divisors (286524667).
11332022021 is a wasteful number, since it uses less digits than its factorization.
11332022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241323.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11332022021 its reverse (12022023311), we get a palindrome (23354045332).
The spelling of 11332022021 in words is "eleven billion, three hundred thirty-two million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •