Base | Representation |
---|---|
bin | 10101011110000000… |
… | …100110011000100000 |
3 | 2012111112111120111201 |
4 | 111132000212120200 |
5 | 334202311131000 |
6 | 14331233250544 |
7 | 1444152131455 |
oct | 253600463040 |
9 | 65445446451 |
10 | 23052052000 |
11 | 985a31194a |
12 | 4574103a54 |
13 | 2234ab5573 |
14 | 118979b82c |
15 | 8edb9296a |
hex | 55e026620 |
23052052000 has 48 divisors (see below), whose sum is σ = 56638901592. Its totient is φ = 9220819200.
The previous prime is 23052051989. The next prime is 23052052007. The reversal of 23052052000 is 25025032.
It can be written as a sum of positive squares in 4 ways, for example, as 740057616 + 22311994384 = 27204^2 + 149372^2 .
It is not an unprimeable number, because it can be changed into a prime (23052052007) 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, 2877507 + ... + 2885506.
Almost surely, 223052052000 is an apocalyptic number.
23052052000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23052052000 is an abundant number, since it is smaller than the sum of its proper divisors (33586849592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23052052000 is an equidigital number, since it uses as much as digits as its factorization.
23052052000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5763038 (or 5763020 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 19.
Adding to 23052052000 its reverse (25025032), we get a palindrome (23077077032).
It can be divided in two parts, 2305205 and 2000, that multiplied together give a square (4610410000 = 679002).
The spelling of 23052052000 in words is "twenty-three billion, fifty-two million, fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •