Base | Representation |
---|---|
bin | 10100101111000010… |
… | …10000011100101101 |
3 | 1001201210211211010002 |
4 | 22113201100130231 |
5 | 140244243343313 |
6 | 5040341354045 |
7 | 542601354311 |
oct | 122741203455 |
9 | 31653754102 |
10 | 11132012333 |
11 | 47a28046a2 |
12 | 21a8108925 |
13 | 1085399060 |
14 | 778635b41 |
15 | 452469058 |
hex | 29785072d |
11132012333 has 4 divisors (see below), whose sum is σ = 11988320988. Its totient is φ = 10275703680.
The previous prime is 11132012323. The next prime is 11132012347. The reversal of 11132012333 is 33321023111.
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 495596644 + 10636415689 = 22262^2 + 103133^2 .
It is a cyclic number.
It is not a de Polignac number, because 11132012333 - 214 = 11131995949 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 (11132012323) 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, 428154308 + ... + 428154333.
It is an arithmetic number, because the mean of its divisors is an integer number (2997080247).
Almost surely, 211132012333 is an apocalyptic number.
11132012333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11132012333 is a deficient number, since it is larger than the sum of its proper divisors (856308655).
11132012333 is an equidigital number, since it uses as much as digits as its factorization.
11132012333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 856308654.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11132012333 its reverse (33321023111), we get a palindrome (44453035444).
The spelling of 11132012333 in words is "eleven billion, one hundred thirty-two million, twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •