Base | Representation |
---|---|
bin | 1010100000011010110011… |
… | …00010111000100100011011 |
3 | 10000210201210122100002110212 |
4 | 11100031121202320210123 |
5 | 11012014230114331021 |
6 | 121045520315001335 |
7 | 4603134625421222 |
oct | 520153142704433 |
9 | 100721718302425 |
10 | 23104131402011 |
11 | 73a8452942340 |
12 | 271189aa3924b |
13 | cb793053173a |
14 | 59c362b71cb9 |
15 | 2a0ed139385b |
hex | 1503598b891b |
23104131402011 has 4 divisors (see below), whose sum is σ = 25204506984024. Its totient is φ = 21003755820000.
The previous prime is 23104131401993. The next prime is 23104131402047. The reversal of 23104131402011 is 11020413140132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23104131402011 is a prime.
It is a super-3 number, since 3×231041314020113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23104131402511) 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, 1050187790990 + ... + 1050187791011.
It is an arithmetic number, because the mean of its divisors is an integer number (6301126746006).
Almost surely, 223104131402011 is an apocalyptic number.
23104131402011 is a deficient number, since it is larger than the sum of its proper divisors (2100375582013).
23104131402011 is a wasteful number, since it uses less digits than its factorization.
23104131402011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2100375582012.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 23104131402011 its reverse (11020413140132), we get a palindrome (34124544542143).
The spelling of 23104131402011 in words is "twenty-three trillion, one hundred four billion, one hundred thirty-one million, four hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •