Base | Representation |
---|---|
bin | 1010011101011001111010… |
… | …01000111110110011010001 |
3 | 10000102211111122220001101101 |
4 | 11032230331020332303101 |
5 | 11003320134330302031 |
6 | 120530152451304401 |
7 | 4562510464055053 |
oct | 516547510766321 |
9 | 100384448801341 |
10 | 23000575634641 |
11 | 736854235a620 |
12 | 26b57ba2ab101 |
13 | caac3915b147 |
14 | 59733b7978d3 |
15 | 29d46edd3361 |
hex | 14eb3d23ecd1 |
23000575634641 has 4 divisors (see below), whose sum is σ = 25091537055984. Its totient is φ = 20909614213300.
The previous prime is 23000575634629. The next prime is 23000575634657. The reversal of 23000575634641 is 14643657500032.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 23000575634641 - 231 = 22998428150993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23000575634591 and 23000575634600.
It is not an unprimeable number, because it can be changed into a prime (23000575634611) 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, 1045480710655 + ... + 1045480710676.
It is an arithmetic number, because the mean of its divisors is an integer number (6272884263996).
Almost surely, 223000575634641 is an apocalyptic number.
It is an amenable number.
23000575634641 is a deficient number, since it is larger than the sum of its proper divisors (2090961421343).
23000575634641 is a wasteful number, since it uses less digits than its factorization.
23000575634641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2090961421342.
The product of its (nonzero) digits is 1814400, while the sum is 46.
The spelling of 23000575634641 in words is "twenty-three trillion, five hundred seventy-five million, six hundred thirty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •