Base | Representation |
---|---|
bin | 101101110110001010111… |
… | …101100010000100110010 |
3 | 102011012002201101021121220 |
4 | 231312022331202010302 |
5 | 403104302324223010 |
6 | 10411201133525510 |
7 | 443422243443456 |
oct | 55661275420462 |
9 | 12135081337556 |
10 | 3150542414130 |
11 | 1005157070671 |
12 | 42a71a343896 |
13 | 19b130594a67 |
14 | ac6b6720666 |
15 | 56e45c68970 |
hex | 2dd8af62132 |
3150542414130 has 16 divisors (see below), whose sum is σ = 7561301793984. Its totient is φ = 840144643760.
The previous prime is 3150542414111. The next prime is 3150542414141. The reversal of 3150542414130 is 314142450513.
3150542414130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3150542414091 and 3150542414100.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52509040206 + ... + 52509040265.
It is an arithmetic number, because the mean of its divisors is an integer number (472581362124).
Almost surely, 23150542414130 is an apocalyptic number.
3150542414130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3150542414130 is an abundant number, since it is smaller than the sum of its proper divisors (4410759379854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3150542414130 is a wasteful number, since it uses less digits than its factorization.
3150542414130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105018080481.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 3150542414130 its reverse (314142450513), we get a palindrome (3464684864643).
The spelling of 3150542414130 in words is "three trillion, one hundred fifty billion, five hundred forty-two million, four hundred fourteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •