Base | Representation |
---|---|
bin | 1010010011100000110001… |
… | …1011101001011011010011 |
3 | 1111010011120100011020201111 |
4 | 2210320030123221123103 |
5 | 2441114010032113021 |
6 | 40033025515114151 |
7 | 2246406124335313 |
oct | 244701433513323 |
9 | 44104510136644 |
10 | 11330332301011 |
11 | 3679192225979 |
12 | 132ba89442957 |
13 | 6425a4414c69 |
14 | 2b2568d03443 |
15 | 149adbc318e1 |
hex | a4e0c6e96d3 |
11330332301011 has 4 divisors (see below), whose sum is σ = 11367238921192. Its totient is φ = 11293425680832.
The previous prime is 11330332300961. The next prime is 11330332301077. The reversal of 11330332301011 is 11010323303311.
11330332301011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11330332301011 - 29 = 11330332300499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11330332301411) 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, 18453309630 + ... + 18453310243.
It is an arithmetic number, because the mean of its divisors is an integer number (2841809730298).
Almost surely, 211330332301011 is an apocalyptic number.
11330332301011 is a deficient number, since it is larger than the sum of its proper divisors (36906620181).
11330332301011 is an equidigital number, since it uses as much as digits as its factorization.
11330332301011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36906620180.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 11330332301011 its reverse (11010323303311), we get a palindrome (22340655604322).
The spelling of 11330332301011 in words is "eleven trillion, three hundred thirty billion, three hundred thirty-two million, three hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •