Base | Representation |
---|---|
bin | 10101101110000010… |
… | …101110010000111001 |
3 | 2020012021122210012022 |
4 | 111232002232100321 |
5 | 340230141402100 |
6 | 14414042524225 |
7 | 1453626413666 |
oct | 255602562071 |
9 | 66167583168 |
10 | 23321044025 |
11 | 9988137604 |
12 | 462a206675 |
13 | 2278747646 |
14 | 11b33bca6d |
15 | 9175c8e85 |
hex | 56e0ae439 |
23321044025 has 24 divisors (see below), whose sum is σ = 29206966944. Its totient is φ = 18471398400.
The previous prime is 23321044003. The next prime is 23321044027. The reversal of 23321044025 is 52044012332.
It is not a de Polignac number, because 23321044025 - 210 = 23321043001 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23321043985 and 23321044003.
It is not an unprimeable number, because it can be changed into a prime (23321044027) 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 23 ways as a sum of consecutive naturals, for example, 1006622 + ... + 1029528.
It is an arithmetic number, because the mean of its divisors is an integer number (1216956956).
Almost surely, 223321044025 is an apocalyptic number.
23321044025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
23321044025 is a deficient number, since it is larger than the sum of its proper divisors (5885922919).
23321044025 is a wasteful number, since it uses less digits than its factorization.
23321044025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23321 (or 23316 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 26.
Adding to 23321044025 its reverse (52044012332), we get a palindrome (75365056357).
The spelling of 23321044025 in words is "twenty-three billion, three hundred twenty-one million, forty-four thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •