Base | Representation |
---|---|
bin | 1011001011010000… |
… | …1000101000100101 |
3 | 21202002001100211200 |
4 | 2302310020220211 |
5 | 22121000330201 |
6 | 1213404353113 |
7 | 134225450430 |
oct | 26264105045 |
9 | 7662040750 |
10 | 3000011301 |
11 | 12aa478991 |
12 | 6b8845799 |
13 | 38a6b9721 |
14 | 20660a817 |
15 | 128597386 |
hex | b2d08a25 |
3000011301 has 48 divisors (see below), whose sum is σ = 5252292864. Its totient is φ = 1610813952.
The previous prime is 3000011297. The next prime is 3000011309. The reversal of 3000011301 is 1031100003.
It is not a de Polignac number, because 3000011301 - 22 = 3000011297 is a prime.
It is a super-2 number, since 2×30000113012 = 18000135612255425202, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3000011309) 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 47 ways as a sum of consecutive naturals, for example, 776691 + ... + 780543.
It is an arithmetic number, because the mean of its divisors is an integer number (109422768).
Almost surely, 23000011301 is an apocalyptic number.
It is an amenable number.
3000011301 is a deficient number, since it is larger than the sum of its proper divisors (2252281563).
3000011301 is a wasteful number, since it uses less digits than its factorization.
3000011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4610 (or 4607 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 3000011301 is about 54772.3589139632. The cubic root of 3000011301 is about 1442.2513812898.
Adding to 3000011301 its reverse (1031100003), we get a palindrome (4031111304).
The spelling of 3000011301 in words is "three billion, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •