Base | Representation |
---|---|
bin | 10100111010111101… |
… | …01110110000010101 |
3 | 1001222210000101200211 |
4 | 22131132232300111 |
5 | 141000343411313 |
6 | 5054313005421 |
7 | 545224352362 |
oct | 123536566025 |
9 | 31883011624 |
10 | 11232013333 |
11 | 48441a6952 |
12 | 22156b3871 |
13 | 10a0010148 |
14 | 787a27469 |
15 | 45b11de3d |
hex | 29d7aec15 |
11232013333 has 4 divisors (see below), whose sum is σ = 11358215820. Its totient is φ = 11105810848.
The previous prime is 11232013277. The next prime is 11232013357. The reversal of 11232013333 is 33331023211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5157681489 + 6074331844 = 71817^2 + 77938^2 .
It is a cyclic number.
It is not a de Polignac number, because 11232013333 - 29 = 11232012821 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 (11232013433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 63101110 + ... + 63101287.
It is an arithmetic number, because the mean of its divisors is an integer number (2839553955).
Almost surely, 211232013333 is an apocalyptic number.
It is an amenable number.
11232013333 is a deficient number, since it is larger than the sum of its proper divisors (126202487).
11232013333 is an equidigital number, since it uses as much as digits as its factorization.
11232013333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126202486.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 11232013333 its reverse (33331023211), we get a palindrome (44563036544).
The spelling of 11232013333 in words is "eleven billion, two hundred thirty-two million, thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •