Base | Representation |
---|---|
bin | 1100000010001010… |
… | …0110011000000000 |
3 | 22100010101000110000 |
4 | 3000202212120000 |
5 | 23103423424202 |
6 | 1252312240000 |
7 | 143023026201 |
oct | 30042463000 |
9 | 8303330400 |
10 | 3230295552 |
11 | 1408465950 |
12 | 7619a0000 |
13 | 3c63181b3 |
14 | 2290335a8 |
15 | 13d8d491c |
hex | c08a6600 |
3230295552 has 400 divisors, whose sum is σ = 10772091792. Its totient is φ = 955514880.
The previous prime is 3230295547. The next prime is 3230295553. The reversal of 3230295552 is 2555920323.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3230295553) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 33301968 + ... + 33302064.
Almost surely, 23230295552 is an apocalyptic number.
3230295552 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3230295552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5386045896).
3230295552 is an abundant number, since it is smaller than the sum of its proper divisors (7541796240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3230295552 is an equidigital number, since it uses as much as digits as its factorization.
3230295552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211 (or 186 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 36.
The square root of 3230295552 is about 56835.6890694571. The cubic root of 3230295552 is about 1478.2484074621.
The spelling of 3230295552 in words is "three billion, two hundred thirty million, two hundred ninety-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •