Base | Representation |
---|---|
bin | 10100100010111000… |
… | …00111111001110001 |
3 | 1001110200220020001020 |
4 | 22101130013321301 |
5 | 140042140101223 |
6 | 5022255130053 |
7 | 540222324030 |
oct | 122134077161 |
9 | 31420806036 |
10 | 11030003313 |
11 | 475017081a |
12 | 2179b13929 |
13 | 106a200ca4 |
14 | 768c80717 |
15 | 4485191e3 |
hex | 291707e71 |
11030003313 has 8 divisors (see below), whose sum is σ = 16807624128. Its totient is φ = 6302859024.
The previous prime is 11030003293. The next prime is 11030003317. The reversal of 11030003313 is 31330003011.
11030003313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11030003313 - 228 = 10761567857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11030003292 and 11030003301.
It is not an unprimeable number, because it can be changed into a prime (11030003317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262619106 + ... + 262619147.
It is an arithmetic number, because the mean of its divisors is an integer number (2100953016).
Almost surely, 211030003313 is an apocalyptic number.
It is an amenable number.
11030003313 is a deficient number, since it is larger than the sum of its proper divisors (5777620815).
11030003313 is an equidigital number, since it uses as much as digits as its factorization.
11030003313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525238263.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 11030003313 its reverse (31330003011), we get a palindrome (42360006324).
The spelling of 11030003313 in words is "eleven billion, thirty million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •