Base | Representation |
---|---|
bin | 1010100100000111010101… |
… | …10001100101100001001001 |
3 | 10001020212120211120002011121 |
4 | 11102003222301211201021 |
5 | 11021104314213112131 |
6 | 121224121412155241 |
7 | 4615251600631450 |
oct | 522035261454111 |
9 | 101225524502147 |
10 | 23231122004041 |
11 | 7447299812206 |
12 | 273241b908b21 |
13 | cc68baab11c3 |
14 | 5a456c6a9b97 |
15 | 2a4464e08911 |
hex | 1520eac65849 |
23231122004041 has 16 divisors (see below), whose sum is σ = 28112777291520. Its totient is φ = 18740294899200.
The previous prime is 23231122004023. The next prime is 23231122004117. The reversal of 23231122004041 is 14040022113232.
It is not a de Polignac number, because 23231122004041 - 223 = 23231113615433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23231122003997 and 23231122004015.
It is not an unprimeable number, because it can be changed into a prime (23231122004341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1167676 + ... + 6915613.
It is an arithmetic number, because the mean of its divisors is an integer number (1757048580720).
Almost surely, 223231122004041 is an apocalyptic number.
It is an amenable number.
23231122004041 is a deficient number, since it is larger than the sum of its proper divisors (4881655287479).
23231122004041 is a wasteful number, since it uses less digits than its factorization.
23231122004041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8107464.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 23231122004041 its reverse (14040022113232), we get a palindrome (37271144117273).
The spelling of 23231122004041 in words is "twenty-three trillion, two hundred thirty-one billion, one hundred twenty-two million, four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •