Base | Representation |
---|---|
bin | 1011001110010110… |
… | …1110101100000110 |
3 | 21202222111212202120 |
4 | 2303211232230012 |
5 | 22132312342410 |
6 | 1214551150410 |
7 | 134444116134 |
oct | 26345565406 |
9 | 7688455676 |
10 | 3013012230 |
11 | 1306848758 |
12 | 701075406 |
13 | 3902bc197 |
14 | 208232754 |
15 | 1297b4570 |
hex | b396eb06 |
3013012230 has 64 divisors (see below), whose sum is σ = 7366749120. Its totient is φ = 788547584.
The previous prime is 3013012169. The next prime is 3013012237. The reversal of 3013012230 is 322103103.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013012237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 361672 + ... + 369908.
It is an arithmetic number, because the mean of its divisors is an integer number (115105455).
Almost surely, 23013012230 is an apocalyptic number.
3013012230 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3013012230 is an abundant number, since it is smaller than the sum of its proper divisors (4353736890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3013012230 is a wasteful number, since it uses less digits than its factorization.
3013012230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8473.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3013012230 is about 54890.9120893432. The cubic root of 3013012230 is about 1444.3317719849.
Adding to 3013012230 its reverse (322103103), we get a palindrome (3335115333).
The spelling of 3013012230 in words is "three billion, thirteen million, twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •