Base | Representation |
---|---|
bin | 10101100111101000… |
… | …001110000100110101 |
3 | 2012220210011120211000 |
4 | 111213220032010311 |
5 | 340020114330031 |
6 | 14355240233513 |
7 | 1451151632433 |
oct | 254750160465 |
9 | 65823146730 |
10 | 23213433141 |
11 | 9932417998 |
12 | 45ba16b899 |
13 | 225c36a872 |
14 | 11a2da9d53 |
15 | 90ce1e3e6 |
hex | 567a0e135 |
23213433141 has 32 divisors (see below), whose sum is σ = 36211968000. Its totient is φ = 14656384944.
The previous prime is 23213433079. The next prime is 23213433143. The reversal of 23213433141 is 14133431232.
It is a happy number.
23213433141 is a `hidden beast` number, since 2 + 3 + 2 + 1 + 343 + 314 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-23213433141 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23213433143) 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, 2284450 + ... + 2294588.
It is an arithmetic number, because the mean of its divisors is an integer number (1131624000).
Almost surely, 223213433141 is an apocalyptic number.
It is an amenable number.
23213433141 is a deficient number, since it is larger than the sum of its proper divisors (12998534859).
23213433141 is a wasteful number, since it uses less digits than its factorization.
23213433141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14630 (or 14624 counting only the distinct ones).
The product of its digits is 5184, while the sum is 27.
Adding to 23213433141 its reverse (14133431232), we get a palindrome (37346864373).
The spelling of 23213433141 in words is "twenty-three billion, two hundred thirteen million, four hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •