Base | Representation |
---|---|
bin | 1010000000111111110111… |
… | …0111000111010100111111 |
3 | 1102222202120100111120200210 |
4 | 2200033331313013110333 |
5 | 2420411102111410411 |
6 | 35230543523323503 |
7 | 2214416034536103 |
oct | 240177567072477 |
9 | 42882510446623 |
10 | 11012260263231 |
11 | 3566300914167 |
12 | 129a2bb820593 |
13 | 61b5b4482896 |
14 | 2a0dd3981903 |
15 | 1416c2bd9ca6 |
hex | a03fddc753f |
11012260263231 has 8 divisors (see below), whose sum is σ = 15079851892144. Its totient is φ = 7143087738240.
The previous prime is 11012260263223. The next prime is 11012260263233. The reversal of 11012260263231 is 13236206221011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11012260263231 - 23 = 11012260263223 is a prime.
It is a super-2 number, since 2×110122602632312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012260263233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49604775850 + ... + 49604776071.
It is an arithmetic number, because the mean of its divisors is an integer number (1884981486518).
Almost surely, 211012260263231 is an apocalyptic number.
11012260263231 is a deficient number, since it is larger than the sum of its proper divisors (4067591628913).
11012260263231 is an equidigital number, since it uses as much as digits as its factorization.
11012260263231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99209551961.
The product of its (nonzero) digits is 5184, while the sum is 30.
Adding to 11012260263231 its reverse (13236206221011), we get a palindrome (24248466484242).
The spelling of 11012260263231 in words is "eleven trillion, twelve billion, two hundred sixty million, two hundred sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •