Base | Representation |
---|---|
bin | 1010010011000110010000… |
… | …0101101101100100011111 |
3 | 1111002111012011221212010020 |
4 | 2210301210011231210133 |
5 | 2441004420012324411 |
6 | 40025451240043223 |
7 | 2246034526353402 |
oct | 244614405554437 |
9 | 44074164855106 |
10 | 11323213011231 |
11 | 3676169605110 |
12 | 132a621163513 |
13 | 641a0b4a3464 |
14 | 2b20915b3d39 |
15 | 149821c02606 |
hex | a4c6416d91f |
11323213011231 has 32 divisors (see below), whose sum is σ = 16607335315968. Its totient is φ = 6805486218240.
The previous prime is 11323213011211. The next prime is 11323213011239. The reversal of 11323213011231 is 13211031232311.
It is not a de Polignac number, because 11323213011231 - 25 = 11323213011199 is a prime.
It is a super-2 number, since 2×113232130112312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11323213011239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3135246 + ... + 5698788.
It is an arithmetic number, because the mean of its divisors is an integer number (518979228624).
Almost surely, 211323213011231 is an apocalyptic number.
11323213011231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11323213011231 is a deficient number, since it is larger than the sum of its proper divisors (5284122304737).
11323213011231 is a wasteful number, since it uses less digits than its factorization.
11323213011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2564671.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11323213011231 its reverse (13211031232311), we get a palindrome (24534244243542).
The spelling of 11323213011231 in words is "eleven trillion, three hundred twenty-three billion, two hundred thirteen million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •