Base | Representation |
---|---|
bin | 10100110001011000… |
… | …000101010000010000 |
3 | 2010120100110122000011 |
4 | 110301120011100100 |
5 | 331134111424130 |
6 | 14125043404304 |
7 | 1416460232014 |
oct | 246130052020 |
9 | 63510418004 |
10 | 22303233040 |
11 | 9505659100 |
12 | 43a5383694 |
13 | 214591251a |
14 | 1118156544 |
15 | 8a807a52a |
hex | 531605410 |
22303233040 has 60 divisors (see below), whose sum is σ = 56997687852. Its totient is φ = 8110263040.
The previous prime is 22303233023. The next prime is 22303233047. The reversal of 22303233040 is 4033230322.
It can be written as a sum of positive squares in 2 ways, for example, as 16326706176 + 5976526864 = 127776^2 + 77308^2 .
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (22303233047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1142347 + ... + 1161706.
Almost surely, 222303233040 is an apocalyptic number.
22303233040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22303233040 is an abundant number, since it is smaller than the sum of its proper divisors (34694454812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22303233040 is a wasteful number, since it uses less digits than its factorization.
22303233040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304088 (or 2304071 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 22.
Adding to 22303233040 its reverse (4033230322), we get a palindrome (26336463362).
The spelling of 22303233040 in words is "twenty-two billion, three hundred three million, two hundred thirty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •