Base | Representation |
---|---|
bin | 110001000111010001110… |
… | …110100010011000110010 |
3 | 102221122122102202120210201 |
4 | 301013101312202120302 |
5 | 420244120413442010 |
6 | 11102252532345414 |
7 | 465561245116354 |
oct | 61072166423062 |
9 | 12848572676721 |
10 | 3375070062130 |
11 | 10913a5075838 |
12 | 46614017526a |
13 | 1b63632c5900 |
14 | b94d614d0d4 |
15 | 5cbd76a923a |
hex | 311d1da2632 |
3375070062130 has 48 divisors (see below), whose sum is σ = 6702511759560. Its totient is φ = 1222666857984.
The previous prime is 3375070062103. The next prime is 3375070062137. The reversal of 3375070062130 is 312600705733.
It can be written as a sum of positive squares in 12 ways, for example, as 326739135321 + 3048330926809 = 571611^2 + 1745947^2 .
It is a super-2 number, since 2×33750700621302 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3375070062130.
It is not an unprimeable number, because it can be changed into a prime (3375070062137) 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 23 ways as a sum of consecutive naturals, for example, 18750835 + ... + 18929974.
Almost surely, 23375070062130 is an apocalyptic number.
3375070062130 is a deficient number, since it is larger than the sum of its proper divisors (3327441697430).
3375070062130 is a wasteful number, since it uses less digits than its factorization.
3375070062130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37680895 (or 37680882 counting only the distinct ones).
The product of its (nonzero) digits is 79380, while the sum is 37.
Adding to 3375070062130 its reverse (312600705733), we get a palindrome (3687670767863).
The spelling of 3375070062130 in words is "three trillion, three hundred seventy-five billion, seventy million, sixty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •