Base | Representation |
---|---|
bin | 1010010011000010011111… |
… | …0101011001000101000001 |
3 | 1111002101120201202020122202 |
4 | 2210300213311121011001 |
5 | 2441000332214200113 |
6 | 40025203044442545 |
7 | 2246000502636416 |
oct | 244604765310501 |
9 | 44071521666582 |
10 | 11322202100033 |
11 | 367579aa09610 |
12 | 132a39a6a9455 |
13 | 6418a9c15a56 |
14 | 2b1dd722610d |
15 | 1497b30b8258 |
hex | a4c27d59141 |
11322202100033 has 16 divisors (see below), whose sum is σ = 12357864066240. Its totient is φ = 10287603244800.
The previous prime is 11322202100023. The next prime is 11322202100047. The reversal of 11322202100033 is 33000120222311.
It is a cyclic number.
It is not a de Polignac number, because 11322202100033 - 26 = 11322202099969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11322202099978 and 11322202100014.
It is not an unprimeable number, because it can be changed into a prime (11322202100003) 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, 202817141 + ... + 202872957.
It is an arithmetic number, because the mean of its divisors is an integer number (772366504140).
Almost surely, 211322202100033 is an apocalyptic number.
It is an amenable number.
11322202100033 is a deficient number, since it is larger than the sum of its proper divisors (1035661966207).
11322202100033 is a wasteful number, since it uses less digits than its factorization.
11322202100033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65008.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11322202100033 its reverse (33000120222311), we get a palindrome (44322322322344).
The spelling of 11322202100033 in words is "eleven trillion, three hundred twenty-two billion, two hundred two million, one hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •