Base | Representation |
---|---|
bin | 1010000010001101100101… |
… | …1000111111001000001111 |
3 | 1110001202102022211200212120 |
4 | 2200203121120333020033 |
5 | 2421231314021101111 |
6 | 35244314041104023 |
7 | 2216055036005631 |
oct | 240433130771017 |
9 | 43052368750776 |
10 | 11033123222031 |
11 | 3574137475979 |
12 | 12a2362788013 |
13 | 62055a885011 |
14 | 2a2012700a51 |
15 | 141ee45b7406 |
hex | a08d963f20f |
11033123222031 has 16 divisors (see below), whose sum is σ = 15325049214720. Its totient is φ = 7054387724480.
The previous prime is 11033123222029. The next prime is 11033123222063. The reversal of 11033123222031 is 13022232133011.
It is a cyclic number.
It is not a de Polignac number, because 11033123222031 - 21 = 11033123222029 is a prime.
It is a super-2 number, since 2×110331232220312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11033123221992 and 11033123222010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11033123222131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 760163835 + ... + 760178348.
It is an arithmetic number, because the mean of its divisors is an integer number (957815575920).
Almost surely, 211033123222031 is an apocalyptic number.
11033123222031 is a deficient number, since it is larger than the sum of its proper divisors (4291925992689).
11033123222031 is a wasteful number, since it uses less digits than its factorization.
11033123222031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1520342286.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11033123222031 its reverse (13022232133011), we get a palindrome (24055355355042).
The spelling of 11033123222031 in words is "eleven trillion, thirty-three billion, one hundred twenty-three million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •