Base | Representation |
---|---|
bin | 10110000000100001… |
… | …111111001000000001 |
3 | 2020222220022211121001 |
4 | 112000201333020001 |
5 | 341344043320231 |
6 | 14504523132001 |
7 | 1464414064441 |
oct | 260041771001 |
9 | 66886284531 |
10 | 23631229441 |
11 | a027238496 |
12 | 46b6074001 |
13 | 22c7aa0501 |
14 | 1202684121 |
15 | 93494ab61 |
hex | 58087f201 |
23631229441 has 8 divisors (see below), whose sum is σ = 23680546344. Its totient is φ = 23581958400.
The previous prime is 23631229421. The next prime is 23631229451. The reversal of 23631229441 is 14492213632.
It can be written as a sum of positive squares in 4 ways, for example, as 7516196416 + 16115033025 = 86696^2 + 126945^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 23631229441 - 27 = 23631229313 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23631229441.
It is not an unprimeable number, because it can be changed into a prime (23631229421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1137241 + ... + 1157833.
It is an arithmetic number, because the mean of its divisors is an integer number (2960068293).
Almost surely, 223631229441 is an apocalyptic number.
It is an amenable number.
23631229441 is a deficient number, since it is larger than the sum of its proper divisors (49316903).
23631229441 is a wasteful number, since it uses less digits than its factorization.
23631229441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22931.
The product of its digits is 62208, while the sum is 37.
The spelling of 23631229441 in words is "twenty-three billion, six hundred thirty-one million, two hundred twenty-nine thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •