Base | Representation |
---|---|
bin | 1010101010100100101011… |
… | …00101011000110001011111 |
3 | 10002001002101001120012212122 |
4 | 11111102111211120301133 |
5 | 11033223301421322033 |
6 | 121514101305053155 |
7 | 4640265654424223 |
oct | 525222545306137 |
9 | 102032331505778 |
10 | 23453031042143 |
11 | 7522413670a6a |
12 | 27694307871bb |
13 | 10117c4154641 |
14 | 5b11c0410783 |
15 | 2aa1019dea98 |
hex | 155495958c5f |
23453031042143 has 8 divisors (see below), whose sum is σ = 23472032381280. Its totient is φ = 23434031202400.
The previous prime is 23453031042109. The next prime is 23453031042173. The reversal of 23453031042143 is 34124013035432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23453031042143 - 26 = 23453031042079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23453031042173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32055278 + ... + 32778756.
It is an arithmetic number, because the mean of its divisors is an integer number (2934004047660).
Almost surely, 223453031042143 is an apocalyptic number.
23453031042143 is a deficient number, since it is larger than the sum of its proper divisors (19001339137).
23453031042143 is a wasteful number, since it uses less digits than its factorization.
23453031042143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 749697.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 23453031042143 its reverse (34124013035432), we get a palindrome (57577044077575).
The spelling of 23453031042143 in words is "twenty-three trillion, four hundred fifty-three billion, thirty-one million, forty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •