Base | Representation |
---|---|
bin | 10101000110111010… |
… | …00111100101001111 |
3 | 1002020202122011002021 |
4 | 22203131013211033 |
5 | 141202024112111 |
6 | 5112253311011 |
7 | 550552366330 |
oct | 124335074517 |
9 | 32222564067 |
10 | 11332254031 |
11 | 48958421aa |
12 | 2243195467 |
13 | 10b7a09377 |
14 | 79707c287 |
15 | 464d1ed71 |
hex | 2a374794f |
11332254031 has 16 divisors (see below), whose sum is σ = 13520369664. Its totient is φ = 9286827264.
The previous prime is 11332254029. The next prime is 11332254047. The reversal of 11332254031 is 13045223311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11332254031 - 21 = 11332254029 is a prime.
It is a super-2 number, since 2×113322540312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11332253987 and 11332254005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332254091) 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, 368895 + ... + 398431.
It is an arithmetic number, because the mean of its divisors is an integer number (845023104).
Almost surely, 211332254031 is an apocalyptic number.
11332254031 is a deficient number, since it is larger than the sum of its proper divisors (2188115633).
11332254031 is a wasteful number, since it uses less digits than its factorization.
11332254031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31950.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 11332254031 its reverse (13045223311), we get a palindrome (24377477342).
The spelling of 11332254031 in words is "eleven billion, three hundred thirty-two million, two hundred fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •