Base | Representation |
---|---|
bin | 10100100010111111… |
… | …11111001001100001 |
3 | 1001110202210200020101 |
4 | 22101133333021201 |
5 | 140042420003113 |
6 | 5022332542401 |
7 | 540234042412 |
oct | 122137771141 |
9 | 31422720211 |
10 | 11031016033 |
11 | 47507a2684 |
12 | 217a321a01 |
13 | 106a496c2b |
14 | 769065809 |
15 | 4486692dd |
hex | 2917ff261 |
11031016033 has 4 divisors (see below), whose sum is σ = 11186382528. Its totient is φ = 10875649540.
The previous prime is 11031016013. The next prime is 11031016097. The reversal of 11031016033 is 33061013011.
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 11031016033 - 25 = 11031016001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11031016033.
It is not an unprimeable number, because it can be changed into a prime (11031016013) 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, 77683141 + ... + 77683282.
It is an arithmetic number, because the mean of its divisors is an integer number (2796595632).
Almost surely, 211031016033 is an apocalyptic number.
It is an amenable number.
11031016033 is a deficient number, since it is larger than the sum of its proper divisors (155366495).
11031016033 is an equidigital number, since it uses as much as digits as its factorization.
11031016033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155366494.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11031016033 its reverse (33061013011), we get a palindrome (44092029044).
The spelling of 11031016033 in words is "eleven billion, thirty-one million, sixteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •