Base | Representation |
---|---|
bin | 101000000010000010111110… |
… | …1100100101001000101000000 |
3 | 1201011202211011201111001022221 |
4 | 1100010011331210221011000 |
5 | 332123204000113120000 |
6 | 3244523554141340424 |
7 | 134112122525463211 |
oct | 12004057544510500 |
9 | 1634684151431287 |
10 | 352125000520000 |
11 | a221a412a06174 |
12 | 335b0226267714 |
13 | 12163325557996 |
14 | 62d4d25dd1408 |
15 | 2aa98a545c61a |
hex | 140417d929140 |
352125000520000 has 140 divisors (see below), whose sum is σ = 882966306227940. Its totient is φ = 139267414528000.
The previous prime is 352125000519979. The next prime is 352125000520001. The reversal of 352125000520000 is 25000521253.
It is a happy number.
It can be written as a sum of positive squares in 10 ways, for example, as 336373500078144 + 15751500441856 = 18340488^2 + 3968816^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (352125000520001) 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 19 ways as a sum of consecutive naturals, for example, 45895759 + ... + 53015758.
Almost surely, 2352125000520000 is an apocalyptic number.
It is an amenable number.
352125000520000 is an abundant number, since it is smaller than the sum of its proper divisors (530841305707940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
352125000520000 is an frugal number, since it uses more digits than its factorization.
352125000520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98911638 (or 98911613 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 25.
The spelling of 352125000520000 in words is "three hundred fifty-two trillion, one hundred twenty-five billion, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •