Base | Representation |
---|---|
bin | 1010100100001001100101… |
… | …0101000100000110010001 |
3 | 1112010111100102221020010101 |
4 | 2221002121111010012101 |
5 | 3010304400441113431 |
6 | 40412220404332401 |
7 | 2306145241616206 |
oct | 251023125040621 |
9 | 45114312836111 |
10 | 11616164004241 |
11 | 37794298250a5 |
12 | 13773599a4101 |
13 | 663526aca9c4 |
14 | 2c232247dcad |
15 | 15226a616961 |
hex | a9099544191 |
11616164004241 has 8 divisors (see below), whose sum is σ = 11946171092544. Its totient is φ = 11287002006000.
The previous prime is 11616164004229. The next prime is 11616164004301. The reversal of 11616164004241 is 14240046161611.
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 11616164004241 - 29 = 11616164003729 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
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 11616164004241.
It is not an unprimeable number, because it can be changed into a prime (11616164004941) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211244635 + ... + 211299616.
It is an arithmetic number, because the mean of its divisors is an integer number (1493271386568).
Almost surely, 211616164004241 is an apocalyptic number.
It is an amenable number.
11616164004241 is a deficient number, since it is larger than the sum of its proper divisors (330007088303).
11616164004241 is an equidigital number, since it uses as much as digits as its factorization.
11616164004241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 422545031.
The product of its (nonzero) digits is 27648, while the sum is 37.
The spelling of 11616164004241 in words is "eleven trillion, six hundred sixteen billion, one hundred sixty-four million, four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •