Base | Representation |
---|---|
bin | 10100100011000001… |
… | …10000111101000001 |
3 | 1001110210012001001221 |
4 | 22101200300331001 |
5 | 140042443020113 |
6 | 5022341155041 |
7 | 540235552231 |
oct | 122140607501 |
9 | 31423161057 |
10 | 11031220033 |
11 | 4750921979 |
12 | 217a3bba81 |
13 | 106a538a42 |
14 | 7690b9cc1 |
15 | 4486a998d |
hex | 291830f41 |
11031220033 has 4 divisors (see below), whose sum is σ = 11031433648. Its totient is φ = 11031006420.
The previous prime is 11031220001. The next prime is 11031220037. The reversal of 11031220033 is 33002213011.
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.
It is a cyclic number.
It is not a de Polignac number, because 11031220033 - 25 = 11031220001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11031219989 and 11031220016.
It is not an unprimeable number, because it can be changed into a prime (11031220037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24298 + ... + 150508.
It is an arithmetic number, because the mean of its divisors is an integer number (2757858412).
Almost surely, 211031220033 is an apocalyptic number.
It is an amenable number.
11031220033 is a deficient number, since it is larger than the sum of its proper divisors (213615).
11031220033 is an equidigital number, since it uses as much as digits as its factorization.
11031220033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213614.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 11031220033 its reverse (33002213011), we get a palindrome (44033433044).
The spelling of 11031220033 in words is "eleven billion, thirty-one million, two hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •