Base | Representation |
---|---|
bin | 10011101010010100101… |
… | …001110000011001001000 |
3 | 11210011110102210200221112 |
4 | 103222110221300121020 |
5 | 134114040102030112 |
6 | 2512405411425452 |
7 | 166420600000520 |
oct | 23522451603110 |
9 | 4704412720845 |
10 | 1351113705032 |
11 | 481005510323 |
12 | 199a312b5288 |
13 | 9a542805c10 |
14 | 49573b84680 |
15 | 2522b45ba22 |
hex | 13a94a70648 |
1351113705032 has 64 divisors (see below), whose sum is σ = 3129546067200. Its totient is φ = 532519430400.
The previous prime is 1351113705023. The next prime is 1351113705037. The reversal of 1351113705032 is 2305073111531.
It is a self number, because there is not a number n which added to its sum of digits gives 1351113705032.
It is not an unprimeable number, because it can be changed into a prime (1351113705037) 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 15 ways as a sum of consecutive naturals, for example, 3253844 + ... + 3645507.
It is an arithmetic number, because the mean of its divisors is an integer number (48899157300).
Almost surely, 21351113705032 is an apocalyptic number.
It is an amenable number.
1351113705032 is an abundant number, since it is smaller than the sum of its proper divisors (1778432362168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1351113705032 is a wasteful number, since it uses less digits than its factorization.
1351113705032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6899646 (or 6899642 counting only the distinct ones).
The product of its (nonzero) digits is 9450, while the sum is 32.
Adding to 1351113705032 its reverse (2305073111531), we get a palindrome (3656186816563).
The spelling of 1351113705032 in words is "one trillion, three hundred fifty-one billion, one hundred thirteen million, seven hundred five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •