Base | Representation |
---|---|
bin | 1011101111000100… |
… | …1110100010111110 |
3 | 22010112201222101211 |
4 | 2323301032202332 |
5 | 22422430302110 |
6 | 1240332355034 |
7 | 141031426633 |
oct | 27361164276 |
9 | 8115658354 |
10 | 3150244030 |
11 | 1377259a6a |
12 | 73b015a7a |
13 | 3b286a52b |
14 | 21c55618a |
15 | 13687098a |
hex | bbc4e8be |
3150244030 has 8 divisors (see below), whose sum is σ = 5670439272. Its totient is φ = 1260097608.
The previous prime is 3150244021. The next prime is 3150244039. The reversal of 3150244030 is 304420513.
It is an interprime number because it is at equal distance from previous prime (3150244021) and next prime (3150244039).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 3150243992 and 3150244010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3150244039) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 157512192 + ... + 157512211.
It is an arithmetic number, because the mean of its divisors is an integer number (708804909).
Almost surely, 23150244030 is an apocalyptic number.
3150244030 is a deficient number, since it is larger than the sum of its proper divisors (2520195242).
3150244030 is a wasteful number, since it uses less digits than its factorization.
3150244030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315024410.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 3150244030 is about 56127.0347515348. The cubic root of 3150244030 is about 1465.9350621755.
Adding to 3150244030 its reverse (304420513), we get a palindrome (3454664543).
The spelling of 3150244030 in words is "three billion, one hundred fifty million, two hundred forty-four thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •