Base | Representation |
---|---|
bin | 10101100011011100… |
… | …101111010000001001 |
3 | 2012201220020012001010 |
4 | 111203130233100021 |
5 | 334344142030231 |
6 | 14344253314133 |
7 | 1446340632642 |
oct | 254334572011 |
9 | 65656205033 |
10 | 23143314441 |
11 | 98a6885755 |
12 | 459a795949 |
13 | 224a98a000 |
14 | 11979566c9 |
15 | 906bbd546 |
hex | 56372f409 |
23143314441 has 32 divisors (see below), whose sum is σ = 33466608000. Its totient is φ = 14225625024.
The previous prime is 23143314421. The next prime is 23143314443. The reversal of 23143314441 is 14441334132.
It is not a de Polignac number, because 23143314441 - 217 = 23143183369 is a prime.
It is a super-2 number, since 2×231433144412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23143314399 and 23143314408.
It is not an unprimeable number, because it can be changed into a prime (23143314443) 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 31 ways as a sum of consecutive naturals, for example, 8296675 + ... + 8299463.
It is an arithmetic number, because the mean of its divisors is an integer number (1045831500).
Almost surely, 223143314441 is an apocalyptic number.
It is an amenable number.
23143314441 is a deficient number, since it is larger than the sum of its proper divisors (10323293559).
23143314441 is a wasteful number, since it uses less digits than its factorization.
23143314441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4090 (or 4064 counting only the distinct ones).
The product of its digits is 13824, while the sum is 30.
Adding to 23143314441 its reverse (14441334132), we get a palindrome (37584648573).
The spelling of 23143314441 in words is "twenty-three billion, one hundred forty-three million, three hundred fourteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •