Base | Representation |
---|---|
bin | 101101100011000011011… |
… | …001000010011100001000 |
3 | 102002020010002010122201102 |
4 | 231203003121002130020 |
5 | 402240232130442300 |
6 | 10353524141240532 |
7 | 442064446451006 |
oct | 55430331023410 |
9 | 12066102118642 |
10 | 3130014312200 |
11 | aa7482530876 |
12 | 42674b563148 |
13 | 19920b675c99 |
14 | ab6ca249a76 |
15 | 566439830d5 |
hex | 2d8c3642708 |
3130014312200 has 24 divisors (see below), whose sum is σ = 7277283276330. Its totient is φ = 1252005724800.
The previous prime is 3130014312197. The next prime is 3130014312209. The reversal of 3130014312200 is 22134100313.
It can be written as a sum of positive squares in 3 ways, for example, as 2105801495044 + 1024212817156 = 1451138^2 + 1012034^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (3130014312209) 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 5 ways as a sum of consecutive naturals, for example, 7825035581 + ... + 7825035980.
Almost surely, 23130014312200 is an apocalyptic number.
It is an amenable number.
3130014312200 is an abundant number, since it is smaller than the sum of its proper divisors (4147268964130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3130014312200 is a wasteful number, since it uses less digits than its factorization.
3130014312200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15650071577 (or 15650071568 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 3130014312200 its reverse (22134100313), we get a palindrome (3152148412513).
The spelling of 3130014312200 in words is "three trillion, one hundred thirty billion, fourteen million, three hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •