Base | Representation |
---|---|
bin | 1011101111000011… |
… | …0010110000100111 |
3 | 22010112112012021110 |
4 | 2323300302300213 |
5 | 22422413131330 |
6 | 1240330120103 |
7 | 141030444051 |
oct | 27360626047 |
9 | 8115465243 |
10 | 3150130215 |
11 | 1377191501 |
12 | 73ab80033 |
13 | 3b282a79b |
14 | 21c5268d1 |
15 | 13684bdb0 |
hex | bbc32c27 |
3150130215 has 8 divisors (see below), whose sum is σ = 5040208368. Its totient is φ = 1680069440.
The previous prime is 3150130171. The next prime is 3150130229. The reversal of 3150130215 is 5120310513.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3150130215 - 217 = 3149999143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3150130191 and 3150130200.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 105004326 + ... + 105004355.
It is an arithmetic number, because the mean of its divisors is an integer number (630026046).
Almost surely, 23150130215 is an apocalyptic number.
3150130215 is a deficient number, since it is larger than the sum of its proper divisors (1890078153).
3150130215 is a wasteful number, since it uses less digits than its factorization.
3150130215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210008689.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 3150130215 is about 56126.0208370414. The cubic root of 3150130215 is about 1465.9174077327.
Adding to 3150130215 its reverse (5120310513), we get a palindrome (8270440728).
It can be divided in two parts, 31501 and 30215, that added together give a palindrome (61716).
The spelling of 3150130215 in words is "three billion, one hundred fifty million, one hundred thirty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •