Base | Representation |
---|---|
bin | 10100111010111110… |
… | …00110110110001101 |
3 | 1001222210012102001122 |
4 | 22131133012312031 |
5 | 141000410041023 |
6 | 5054315050325 |
7 | 545225243153 |
oct | 123537066615 |
9 | 31883172048 |
10 | 11232112013 |
11 | 4844264001 |
12 | 22157409a5 |
13 | 10a0046035 |
14 | 787a513d3 |
15 | 45b13d2c8 |
hex | 29d7c6d8d |
11232112013 has 4 divisors (see below), whose sum is σ = 11240628960. Its totient is φ = 11223595068.
The previous prime is 11232111977. The next prime is 11232112039. The reversal of 11232112013 is 31021123211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31021123211 = 13 ⋅2386240247.
It is a cyclic number.
It is not a de Polignac number, because 11232112013 - 26 = 11232111949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11232111982 and 11232112000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11232112513) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4256495 + ... + 4259132.
It is an arithmetic number, because the mean of its divisors is an integer number (2810157240).
Almost surely, 211232112013 is an apocalyptic number.
It is an amenable number.
11232112013 is a deficient number, since it is larger than the sum of its proper divisors (8516947).
11232112013 is an equidigital number, since it uses as much as digits as its factorization.
11232112013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8516946.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11232112013 its reverse (31021123211), we get a palindrome (42253235224).
The spelling of 11232112013 in words is "eleven billion, two hundred thirty-two million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •