Base | Representation |
---|---|
bin | 1010100000011010100011… |
… | …11101110011001100000011 |
3 | 10000210201110210001121011121 |
4 | 11100031101331303030003 |
5 | 11012014000041141011 |
6 | 121045455533253111 |
7 | 4603131522520663 |
oct | 520152175631403 |
9 | 100721423047147 |
10 | 23104004240131 |
11 | 73a8398089781 |
12 | 2711864334197 |
13 | cb791009aa19 |
14 | 59c34dd101a3 |
15 | 2a0ec5125e71 |
hex | 150351f73303 |
23104004240131 has 16 divisors (see below), whose sum is σ = 23813046804960. Its totient is φ = 22407358049280.
The previous prime is 23104004240123. The next prime is 23104004240143. The reversal of 23104004240131 is 13104240040132.
It is a cyclic number.
It is not a de Polignac number, because 23104004240131 - 23 = 23104004240123 is a prime.
It is a super-2 number, since 2×231040042401312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23104004240096 and 23104004240105.
It is not an unprimeable number, because it can be changed into a prime (23104004240171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5666101 + ... + 8849446.
It is an arithmetic number, because the mean of its divisors is an integer number (1488315425310).
Almost surely, 223104004240131 is an apocalyptic number.
23104004240131 is a deficient number, since it is larger than the sum of its proper divisors (709042564829).
23104004240131 is a wasteful number, since it uses less digits than its factorization.
23104004240131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14515974.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 23104004240131 its reverse (13104240040132), we get a palindrome (36208244280263).
The spelling of 23104004240131 in words is "twenty-three trillion, one hundred four billion, four million, two hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •