Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …1010111010010111101100 |
3 | 1111010020122011020011111001 |
4 | 2210320330022322113230 |
5 | 2441122130101022312 |
6 | 40033241205410044 |
7 | 2246435021131132 |
oct | 244707412722754 |
9 | 44106564204431 |
10 | 11331133220332 |
11 | 3679563334472 |
12 | 1330071709924 |
13 | 6426a132a413 |
14 | 2b260342b752 |
15 | 149b371db057 |
hex | a4e3c2ba5ec |
11331133220332 has 6 divisors (see below), whose sum is σ = 19829483135588. Its totient is φ = 5665566610164.
The previous prime is 11331133220321. The next prime is 11331133220333. The reversal of 11331133220332 is 23302233113311.
It is a happy number.
It is a super-2 number, since 2×113311332203322 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11331133220332.
It is not an unprimeable number, because it can be changed into a prime (11331133220333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1416391652538 + ... + 1416391652545.
Almost surely, 211331133220332 is an apocalyptic number.
It is an amenable number.
11331133220332 is a deficient number, since it is larger than the sum of its proper divisors (8498349915256).
11331133220332 is a wasteful number, since it uses less digits than its factorization.
11331133220332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2832783305087 (or 2832783305085 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 11331133220332 its reverse (23302233113311), we get a palindrome (34633366333643).
The spelling of 11331133220332 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-three million, two hundred twenty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •