Base | Representation |
---|---|
bin | 10101011101100011… |
… | …011111011110010001 |
3 | 2012111000010220110101 |
4 | 111131203133132101 |
5 | 334143332442041 |
6 | 14330401532401 |
7 | 1444030231252 |
oct | 253543373621 |
9 | 65430126411 |
10 | 23044421521 |
11 | 9855a7aa70 |
12 | 4571644101 |
13 | 22333433a4 |
14 | 1188772b29 |
15 | 8ed186b31 |
hex | 55d8df791 |
23044421521 has 8 divisors (see below), whose sum is σ = 25166209824. Its totient is φ = 20927106720.
The previous prime is 23044421479. The next prime is 23044421537. The reversal of 23044421521 is 12512444032.
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 23044421521 - 211 = 23044419473 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 23044421521.
It is not an unprimeable number, because it can be changed into a prime (23044421021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1107595 + ... + 1128208.
It is an arithmetic number, because the mean of its divisors is an integer number (3145776228).
Almost surely, 223044421521 is an apocalyptic number.
It is an amenable number.
23044421521 is a deficient number, since it is larger than the sum of its proper divisors (2121788303).
23044421521 is a wasteful number, since it uses less digits than its factorization.
23044421521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2236751.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 23044421521 its reverse (12512444032), we get a palindrome (35556865553).
It can be divided in two parts, 2304 and 4421521, that added together give a triangular number (4423825 = T2974).
The spelling of 23044421521 in words is "twenty-three billion, forty-four million, four hundred twenty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •