Base | Representation |
---|---|
bin | 1010010011100111010111… |
… | …0111100010101111010001 |
3 | 1111010100010121200201012211 |
4 | 2210321311313202233101 |
5 | 2441131120403040304 |
6 | 40033521225152121 |
7 | 2246501014036360 |
oct | 244716567425721 |
9 | 44110117621184 |
10 | 11332101221329 |
11 | 3679a0a791999 |
12 | 13302a192b641 |
13 | 6427c6a42785 |
14 | 2b2695c097d7 |
15 | 149b9219b204 |
hex | a4e75de2bd1 |
11332101221329 has 4 divisors (see below), whose sum is σ = 12950972824384. Its totient is φ = 9713229618276.
The previous prime is 11332101221317. The next prime is 11332101221383. The reversal of 11332101221329 is 92312210123311.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 11332101221329 - 27 = 11332101221201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11332101221329.
It is not an unprimeable number, because it can be changed into a prime (11332101201329) 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, 809435801517 + ... + 809435801530.
It is an arithmetic number, because the mean of its divisors is an integer number (3237743206096).
Almost surely, 211332101221329 is an apocalyptic number.
It is an amenable number.
11332101221329 is a deficient number, since it is larger than the sum of its proper divisors (1618871603055).
11332101221329 is an equidigital number, since it uses as much as digits as its factorization.
11332101221329 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1618871603054.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 11332101221329 in words is "eleven trillion, three hundred thirty-two billion, one hundred one million, two hundred twenty-one thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •