Base | Representation |
---|---|
bin | 10100111010111101… |
… | …10011000111101101 |
3 | 1001222210001022020001 |
4 | 22131132303013231 |
5 | 141000344444323 |
6 | 5054313224301 |
7 | 545224455454 |
oct | 123536630755 |
9 | 31883038201 |
10 | 11232031213 |
11 | 4844209327 |
12 | 2215702091 |
13 | 10a0018320 |
14 | 787a2db9b |
15 | 45b1243ad |
hex | 29d7b31ed |
11232031213 has 8 divisors (see below), whose sum is σ = 12101304600. Its totient is φ = 10363510848.
The previous prime is 11232031171. The next prime is 11232031297. The reversal of 11232031213 is 31213023211.
It can be written as a sum of positive squares in 4 ways, for example, as 2957945769 + 8274085444 = 54387^2 + 90962^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11232031213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11232031913) 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, 157078 + ... + 217111.
It is an arithmetic number, because the mean of its divisors is an integer number (1512663075).
Almost surely, 211232031213 is an apocalyptic number.
11232031213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11232031213 is a deficient number, since it is larger than the sum of its proper divisors (869273387).
11232031213 is a wasteful number, since it uses less digits than its factorization.
11232031213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376511.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11232031213 its reverse (31213023211), we get a palindrome (42445054424).
The spelling of 11232031213 in words is "eleven billion, two hundred thirty-two million, thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •