Base | Representation |
---|---|
bin | 1010011110101110111110… |
… | …1011000110010000101011 |
3 | 1111210121012021111210021012 |
4 | 2213223233223012100223 |
5 | 3002243324033342311 |
6 | 40301352204134135 |
7 | 2266342511205251 |
oct | 247535753062053 |
9 | 44717167453235 |
10 | 11523123340331 |
11 | 3742a2479a229 |
12 | 136131283734b |
13 | 65781a057415 |
14 | 2bba177d25d1 |
15 | 14eb2236278b |
hex | a7aefac642b |
11523123340331 has 4 divisors (see below), whose sum is σ = 11524990043952. Its totient is φ = 11521256636712.
The previous prime is 11523123340301. The next prime is 11523123340373. The reversal of 11523123340331 is 13304332132511.
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 11523123340331 - 214 = 11523123323947 is a prime.
It is a super-2 number, since 2×115231233403312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11523123340301) 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, 933342551 + ... + 933354896.
It is an arithmetic number, because the mean of its divisors is an integer number (2881247510988).
Almost surely, 211523123340331 is an apocalyptic number.
11523123340331 is a deficient number, since it is larger than the sum of its proper divisors (1866703621).
11523123340331 is an equidigital number, since it uses as much as digits as its factorization.
11523123340331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1866703620.
The product of its (nonzero) digits is 19440, while the sum is 32.
Adding to 11523123340331 its reverse (13304332132511), we get a palindrome (24827455472842).
The spelling of 11523123340331 in words is "eleven trillion, five hundred twenty-three billion, one hundred twenty-three million, three hundred forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •