Base | Representation |
---|---|
bin | 1100000010110101… |
… | …0010111110101000 |
3 | 22100022122110222220 |
4 | 3000231102332220 |
5 | 23110133142223 |
6 | 1252452314040 |
7 | 143055615420 |
oct | 30055227650 |
9 | 8308573886 |
10 | 3233099688 |
11 | 140a000715 |
12 | 762912920 |
13 | 3c6a8a650 |
14 | 229563480 |
15 | 13dc8a6e3 |
hex | c0b52fa8 |
3233099688 has 128 divisors (see below), whose sum is σ = 10047179520. Its totient is φ = 844185600.
The previous prime is 3233099677. The next prime is 3233099689. The reversal of 3233099688 is 8869903323.
It is a self number, because there is not a number n which added to its sum of digits gives 3233099688.
It is not an unprimeable number, because it can be changed into a prime (3233099689) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 213256 + ... + 227912.
It is an arithmetic number, because the mean of its divisors is an integer number (78493590).
Almost surely, 23233099688 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3233099688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5023589760).
3233099688 is an abundant number, since it is smaller than the sum of its proper divisors (6814079832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3233099688 is a wasteful number, since it uses less digits than its factorization.
3233099688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14787 (or 14783 counting only the distinct ones).
The product of its (nonzero) digits is 1679616, while the sum is 51.
The square root of 3233099688 is about 56860.3525138563. The cubic root of 3233099688 is about 1478.6760268174.
The spelling of 3233099688 in words is "three billion, two hundred thirty-three million, ninety-nine thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •