Base | Representation |
---|---|
bin | 10101100110110110… |
… | …001101000111010000 |
3 | 2012212212111110201012 |
4 | 111212312031013100 |
5 | 340003240301000 |
6 | 14354051230052 |
7 | 1450632324512 |
oct | 254666150720 |
9 | 65785443635 |
10 | 23200322000 |
11 | 9925a82339 |
12 | 45b58a8328 |
13 | 2259729bab |
14 | 11a1355bb2 |
15 | 90bbce735 |
hex | 566d8d1d0 |
23200322000 has 40 divisors (see below), whose sum is σ = 56098383432. Its totient is φ = 9280128000.
The previous prime is 23200321993. The next prime is 23200322009. The reversal of 23200322000 is 22300232.
It can be written as a sum of positive squares in 4 ways, for example, as 24522304 + 23175799696 = 4952^2 + 152236^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23200322009) 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 7 ways as a sum of consecutive naturals, for example, 5798081 + ... + 5802080.
Almost surely, 223200322000 is an apocalyptic number.
23200322000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23200322000 is an abundant number, since it is smaller than the sum of its proper divisors (32898061432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23200322000 is a wasteful number, since it uses less digits than its factorization.
23200322000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11600184 (or 11600168 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 14.
Adding to 23200322000 its reverse (22300232), we get a palindrome (23222622232).
The spelling of 23200322000 in words is "twenty-three billion, two hundred million, three hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •