Base | Representation |
---|---|
bin | 1010011110100101101111… |
… | …0001100011110001010101 |
3 | 1111210100210100102221121102 |
4 | 2213221123301203301111 |
5 | 3002223233323143401 |
6 | 40300302044355445 |
7 | 2266224151210544 |
oct | 247513361436125 |
9 | 44710710387542 |
10 | 11520642006101 |
11 | 3741971085088 |
12 | 136093b845b85 |
13 | 657512c62007 |
14 | 2bb86004015b |
15 | 14ea295c256b |
hex | a7a5bc63c55 |
11520642006101 has 4 divisors (see below), whose sum is σ = 11765762048832. Its totient is φ = 11275521963372.
The previous prime is 11520642006059. The next prime is 11520642006119. The reversal of 11520642006101 is 10160024602511.
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 11520642006101 - 26 = 11520642006037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11520642006151) 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, 122560021295 + ... + 122560021388.
It is an arithmetic number, because the mean of its divisors is an integer number (2941440512208).
Almost surely, 211520642006101 is an apocalyptic number.
It is an amenable number.
11520642006101 is a deficient number, since it is larger than the sum of its proper divisors (245120042731).
11520642006101 is an equidigital number, since it uses as much as digits as its factorization.
11520642006101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245120042730.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 11520642006101 its reverse (10160024602511), we get a palindrome (21680666608612).
The spelling of 11520642006101 in words is "eleven trillion, five hundred twenty billion, six hundred forty-two million, six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •