Base | Representation |
---|---|
bin | 1010011111010010000100… |
… | …0001110011010010101011 |
3 | 1111211111111122002020001012 |
4 | 2213310201001303102223 |
5 | 3002422121033410443 |
6 | 40305550520014135 |
7 | 2300125060503161 |
oct | 247644101632253 |
9 | 44744448066035 |
10 | 11532541310123 |
11 | 3746a17a0a339 |
12 | 136310090134b |
13 | 65868b29b302 |
14 | 2bc26c529231 |
15 | 14eec40a2118 |
hex | a7d210734ab |
11532541310123 has 4 divisors (see below), whose sum is σ = 11844231615840. Its totient is φ = 11220851004408.
The previous prime is 11532541310107. The next prime is 11532541310159. The reversal of 11532541310123 is 32101314523511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11532541310123 - 24 = 11532541310107 is a prime.
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 11532541310123.
It is not an unprimeable number, because it can be changed into a prime (11532541310923) 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, 155845152803 + ... + 155845152876.
It is an arithmetic number, because the mean of its divisors is an integer number (2961057903960).
Almost surely, 211532541310123 is an apocalyptic number.
11532541310123 is a deficient number, since it is larger than the sum of its proper divisors (311690305717).
11532541310123 is an equidigital number, since it uses as much as digits as its factorization.
11532541310123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311690305716.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 11532541310123 its reverse (32101314523511), we get a palindrome (43633855833634).
The spelling of 11532541310123 in words is "eleven trillion, five hundred thirty-two billion, five hundred forty-one million, three hundred ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •