Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0111000011111100111001 |
3 | 1111010020122002022212221102 |
4 | 2210320330013003330321 |
5 | 2441122124321223001 |
6 | 40033241132021145 |
7 | 2246435006425361 |
oct | 244707407037471 |
9 | 44106562285842 |
10 | 11331132211001 |
11 | 3679562805109 |
12 | 13300713017b5 |
13 | 6426a1065b95 |
14 | 2b26032479a1 |
15 | 149b3708be6b |
hex | a4e3c1c3f39 |
11331132211001 has 8 divisors (see below), whose sum is σ = 11609914673280. Its totient is φ = 11053920354768.
The previous prime is 11331132210967. The next prime is 11331132211093. The reversal of 11331132211001 is 10011223113311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11331132211001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11331132213001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 392636906 + ... + 392665763.
It is an arithmetic number, because the mean of its divisors is an integer number (1451239334160).
Almost surely, 211331132211001 is an apocalyptic number.
It is an amenable number.
11331132211001 is a deficient number, since it is larger than the sum of its proper divisors (278782462279).
11331132211001 is an equidigital number, since it uses as much as digits as its factorization.
11331132211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785303023.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 11331132211001 its reverse (10011223113311), we get a palindrome (21342355324312).
The spelling of 11331132211001 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •