Base | Representation |
---|---|
bin | 11110000010100011… |
… | …000100000010011010 |
3 | 10002020220110210211200 |
4 | 132002203010002122 |
5 | 1012024240010410 |
6 | 22452344335030 |
7 | 2221210661001 |
oct | 360243040232 |
9 | 102226423750 |
10 | 32255000730 |
11 | 1275211a4a7 |
12 | 6302174476 |
13 | 3070613064 |
14 | 17bdb21c38 |
15 | c8baac3c0 |
hex | 7828c409a |
32255000730 has 48 divisors (see below), whose sum is σ = 83873058984. Its totient is φ = 8600302080.
The previous prime is 32255000663. The next prime is 32255000731. The reversal of 32255000730 is 3700055223.
It can be written as a sum of positive squares in 4 ways, for example, as 18170770401 + 14084230329 = 134799^2 + 118677^2 .
It is a junction number, because it is equal to n+sod(n) for n = 32255000694 and 32255000703.
It is not an unprimeable number, because it can be changed into a prime (32255000731) 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 23 ways as a sum of consecutive naturals, for example, 1003062 + ... + 1034718.
Almost surely, 232255000730 is an apocalyptic number.
32255000730 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
32255000730 is an abundant number, since it is smaller than the sum of its proper divisors (51618058254).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32255000730 is a wasteful number, since it uses less digits than its factorization.
32255000730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42991 (or 42988 counting only the distinct ones).
The product of its (nonzero) digits is 6300, while the sum is 27.
Adding to 32255000730 its reverse (3700055223), we get a palindrome (35955055953).
The spelling of 32255000730 in words is "thirty-two billion, two hundred fifty-five million, seven hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •