Base | Representation |
---|---|
bin | 1100000001101000101100… |
… | …0010011100100100110001 |
3 | 1201211000220210001110112102 |
4 | 3000122023002130210301 |
5 | 3213113122423331231 |
6 | 44042114130110145 |
7 | 2533163324464661 |
oct | 300321302344461 |
9 | 51730823043472 |
10 | 13222242011441 |
11 | 4238580a04331 |
12 | 159668611b355 |
13 | 74bb10002ab8 |
14 | 339d620841a1 |
15 | 17de1a5e1acb |
hex | c068b09c931 |
13222242011441 has 8 divisors (see below), whose sum is σ = 13284399869568. Its totient is φ = 13160229894000.
The previous prime is 13222242011423. The next prime is 13222242011449. The reversal of 13222242011441 is 14411024222231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13222242011441 - 214 = 13222241995057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13222242011449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36253295 + ... + 36616196.
It is an arithmetic number, because the mean of its divisors is an integer number (1660549983696).
Almost surely, 213222242011441 is an apocalyptic number.
It is an amenable number.
13222242011441 is a deficient number, since it is larger than the sum of its proper divisors (62157858127).
13222242011441 is an equidigital number, since it uses as much as digits as its factorization.
13222242011441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72870343.
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 13222242011441 its reverse (14411024222231), we get a palindrome (27633266233672).
The spelling of 13222242011441 in words is "thirteen trillion, two hundred twenty-two billion, two hundred forty-two million, eleven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •