Base | Representation |
---|---|
bin | 1011001101111010… |
… | …0011011101011110 |
3 | 21202211222022111220 |
4 | 2303132203131132 |
5 | 22131322144410 |
6 | 1214442554210 |
7 | 134422123152 |
oct | 26336433536 |
9 | 7684868456 |
10 | 3011131230 |
11 | 1305783508 |
12 | 700508966 |
13 | 38cab0c73 |
14 | 207ca3062 |
15 | 129542070 |
hex | b37a375e |
3011131230 has 64 divisors (see below), whose sum is σ = 7334203968. Its totient is φ = 791101440.
The previous prime is 3011131157. The next prime is 3011131237. The reversal of 3011131230 is 321311103.
It is a super-2 number, since 2×30111312302 = 18133822568562625800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3011131237) 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, 675810 + ... + 680250.
It is an arithmetic number, because the mean of its divisors is an integer number (114596937).
Almost surely, 23011131230 is an apocalyptic number.
3011131230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3011131230 is an abundant number, since it is smaller than the sum of its proper divisors (4323072738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3011131230 is a wasteful number, since it uses less digits than its factorization.
3011131230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4781.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 3011131230 is about 54873.7754305278. The cubic root of 3011131230 is about 1444.0311477360.
Adding to 3011131230 its reverse (321311103), we get a palindrome (3332442333).
The spelling of 3011131230 in words is "three billion, eleven million, one hundred thirty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •