Base | Representation |
---|---|
bin | 1110111010100111110010… |
… | …01000011010110100111010 |
3 | 11022010200221201121112221011 |
4 | 13131103321020122310322 |
5 | 13244401011300143244 |
6 | 153432210433104134 |
7 | 6623522130564454 |
oct | 735237110326472 |
9 | 138120851545834 |
10 | 32800550006074 |
11 | a4a66a9408304 |
12 | 3818b719b804a |
13 | 153c103893166 |
14 | 8157ab2532d4 |
15 | 3bd33e4dd434 |
hex | 1dd4f921ad3a |
32800550006074 has 4 divisors (see below), whose sum is σ = 49200825009114. Its totient is φ = 16400275003036.
The previous prime is 32800550006071. The next prime is 32800550006087. The reversal of 32800550006074 is 47060005500823.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 21786163029225 + 11014386976849 = 4667565^2 + 3318793^2 .
It is a super-2 number, since 2×328005500060742 (a number of 28 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (32800550006071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8200137501517 + ... + 8200137501520.
Almost surely, 232800550006074 is an apocalyptic number.
32800550006074 is a deficient number, since it is larger than the sum of its proper divisors (16400275003040).
32800550006074 is a wasteful number, since it uses less digits than its factorization.
32800550006074 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16400275003039.
The product of its (nonzero) digits is 201600, while the sum is 40.
Adding to 32800550006074 its reverse (47060005500823), we get a palindrome (79860555506897).
The spelling of 32800550006074 in words is "thirty-two trillion, eight hundred billion, five hundred fifty million, six thousand, seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •