Base | Representation |
---|---|
bin | 1011001110100111… |
… | …1111100101101110 |
3 | 21210001121200002120 |
4 | 2303221333211232 |
5 | 22133104130110 |
6 | 1215031133410 |
7 | 134456453052 |
oct | 26351774556 |
9 | 7701550076 |
10 | 3014130030 |
11 | 130744155a |
12 | 701514266 |
13 | 3905c0bc2 |
14 | 208443c62 |
15 | 129935870 |
hex | b3a7f96e |
3014130030 has 32 divisors (see below), whose sum is σ = 7248160800. Its totient is φ = 802184832.
The previous prime is 3014130017. The next prime is 3014130043. The reversal of 3014130030 is 300314103.
It is an interprime number because it is at equal distance from previous prime (3014130017) and next prime (3014130043).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 3014129991 and 3014130009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83425 + ... + 113964.
It is an arithmetic number, because the mean of its divisors is an integer number (226505025).
Almost surely, 23014130030 is an apocalyptic number.
3014130030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3014130030 is an abundant number, since it is smaller than the sum of its proper divisors (4234030770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3014130030 is a wasteful number, since it uses less digits than its factorization.
3014130030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197908.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3014130030 is about 54901.0931585155. The cubic root of 3014130030 is about 1444.5103611974.
Adding to 3014130030 its reverse (300314103), we get a palindrome (3314444133).
The spelling of 3014130030 in words is "three billion, fourteen million, one hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •