Base | Representation |
---|---|
bin | 10100100111001010… |
… | …11111111001100001 |
3 | 1001120012122211020121 |
4 | 22103211133321201 |
5 | 140130344442304 |
6 | 5030023040241 |
7 | 541140402235 |
oct | 122345377141 |
9 | 31505584217 |
10 | 11066015329 |
11 | 4769528116 |
12 | 2189ba0081 |
13 | 10747cc585 |
14 | 76d9765c5 |
15 | 44b77e554 |
hex | 29395fe61 |
11066015329 has 4 divisors (see below), whose sum is σ = 11066240176. Its totient is φ = 11065790484.
The previous prime is 11066015327. The next prime is 11066015351. The reversal of 11066015329 is 92351066011.
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, and also an emirpimes, since its reverse is a distinct semiprime: 92351066011 = 509 ⋅181436279.
It is a cyclic number.
It is not a de Polignac number, because 11066015329 - 21 = 11066015327 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11066015294 and 11066015303.
It is not an unprimeable number, because it can be changed into a prime (11066015327) 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, 3279 + ... + 148804.
It is an arithmetic number, because the mean of its divisors is an integer number (2766560044).
Almost surely, 211066015329 is an apocalyptic number.
It is an amenable number.
11066015329 is a deficient number, since it is larger than the sum of its proper divisors (224847).
11066015329 is an equidigital number, since it uses as much as digits as its factorization.
11066015329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224846.
The product of its (nonzero) digits is 9720, while the sum is 34.
The spelling of 11066015329 in words is "eleven billion, sixty-six million, fifteen thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •