Base | Representation |
---|---|
bin | 10101110011010110… |
… | …100111000001010001 |
3 | 2020102111022111102221 |
4 | 111303112213001101 |
5 | 340420444041223 |
6 | 14430544341041 |
7 | 1456060635454 |
oct | 256326470121 |
9 | 66374274387 |
10 | 23410143313 |
11 | 9a23463187 |
12 | 4654014781 |
13 | 229104260b |
14 | 11c117349b |
15 | 920328b5d |
hex | 5735a7051 |
23410143313 has 8 divisors (see below), whose sum is σ = 23685690600. Its totient is φ = 23135701248.
The previous prime is 23410143259. The next prime is 23410143319. The reversal of 23410143313 is 31334101432.
It can be written as a sum of positive squares in 4 ways, for example, as 10570307344 + 12839835969 = 102812^2 + 113313^2 .
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 23410143313 - 233 = 14820208721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23410143319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 233656 + ... + 318457.
It is an arithmetic number, because the mean of its divisors is an integer number (2960711325).
Almost surely, 223410143313 is an apocalyptic number.
It is an amenable number.
23410143313 is a deficient number, since it is larger than the sum of its proper divisors (275547287).
23410143313 is a wasteful number, since it uses less digits than its factorization.
23410143313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552611.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 23410143313 its reverse (31334101432), we get a palindrome (54744244745).
The spelling of 23410143313 in words is "twenty-three billion, four hundred ten million, one hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •