Base | Representation |
---|---|
bin | 1011100010111010… |
… | …1000000000011000 |
3 | 21222222202012121220 |
4 | 2320232220000120 |
5 | 22321400331412 |
6 | 1231311132040 |
7 | 136542010440 |
oct | 27056500030 |
9 | 7888665556 |
10 | 3099230232 |
11 | 13504865aa |
12 | 725b14020 |
13 | 3a5118857 |
14 | 215877120 |
15 | 13214568c |
hex | b8ba8018 |
3099230232 has 128 divisors (see below), whose sum is σ = 9188121600. Its totient is φ = 852364800.
The previous prime is 3099230231. The next prime is 3099230263. The reversal of 3099230232 is 2320329903.
It is a junction number, because it is equal to n+sod(n) for n = 3099230193 and 3099230202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3099230231) 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, 2050357 + ... + 2051867.
It is an arithmetic number, because the mean of its divisors is an integer number (71782200).
Almost surely, 23099230232 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 3099230232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4594060800).
3099230232 is an abundant number, since it is smaller than the sum of its proper divisors (6088891368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3099230232 is a wasteful number, since it uses less digits than its factorization.
3099230232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1977 (or 1973 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 33.
The square root of 3099230232 is about 55670.7304784121. The cubic root of 3099230232 is about 1457.9790378233.
The spelling of 3099230232 in words is "three billion, ninety-nine million, two hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •