Base | Representation |
---|---|
bin | 1011010111011011… |
… | …1001101110001100 |
3 | 21212122010022212122 |
4 | 2311312321232030 |
5 | 22222033141200 |
6 | 1222430552112 |
7 | 135415436600 |
oct | 26566715614 |
9 | 7778108778 |
10 | 3051068300 |
11 | 1326280855 |
12 | 711968638 |
13 | 398154c77 |
14 | 20d2db500 |
15 | 12ccd0385 |
hex | b5db9b8c |
3051068300 has 108 divisors (see below), whose sum is σ = 7890135624. Its totient is φ = 1020499200.
The previous prime is 3051068291. The next prime is 3051068327. The reversal of 3051068300 is 38601503.
It is a self number, because there is not a number n which added to its sum of digits gives 3051068300.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 193307 + ... + 208493.
Almost surely, 23051068300 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 3051068300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3945067812).
3051068300 is an abundant number, since it is smaller than the sum of its proper divisors (4839067324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3051068300 is a wasteful number, since it uses less digits than its factorization.
3051068300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15256 (or 15242 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 3051068300 is about 55236.4761729059. The cubic root of 3051068300 is about 1450.3872608115.
Adding to 3051068300 its reverse (38601503), we get a palindrome (3089669803).
The spelling of 3051068300 in words is "three billion, fifty-one million, sixty-eight thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •