Base | Representation |
---|---|
bin | 1010010011100011010000… |
… | …1111110111011010011011 |
3 | 1111010020021220010011201122 |
4 | 2210320310033313122123 |
5 | 2441121342034114321 |
6 | 40033220100435455 |
7 | 2246431515261623 |
oct | 244706417673233 |
9 | 44106256104648 |
10 | 11331000301211 |
11 | 36794a52a9358 |
12 | 13300350a8b8b |
13 | 64267c92c056 |
14 | 2b25cd90b883 |
15 | 149b2a6d28ab |
hex | a4e343f769b |
11331000301211 has 6 divisors (see below), whose sum is σ = 12036737344500. Its totient is φ = 10664470871456.
The previous prime is 11331000301133. The next prime is 11331000301213. The reversal of 11331000301211 is 11210300013311.
It is not a de Polignac number, because 11331000301211 - 218 = 11331000039067 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
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 11331000301211.
It is not an unprimeable number, because it can be changed into a prime (11331000301213) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 19603806461 + ... + 19603807038.
It is an arithmetic number, because the mean of its divisors is an integer number (2006122890750).
Almost surely, 211331000301211 is an apocalyptic number.
11331000301211 is a deficient number, since it is larger than the sum of its proper divisors (705737043289).
11331000301211 is an equidigital number, since it uses as much as digits as its factorization.
11331000301211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39207613533 (or 39207613516 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11331000301211 its reverse (11210300013311), we get a palindrome (22541300314522).
The spelling of 11331000301211 in words is "eleven trillion, three hundred thirty-one billion, three hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •