Base | Representation |
---|---|
bin | 10111111001101111001… |
… | …111101111110111001010 |
3 | 12211000200201010211210202 |
4 | 113321233033233313022 |
5 | 203402412220000000 |
6 | 3254324012212202 |
7 | 226445524561112 |
oct | 27715717576712 |
9 | 5730621124722 |
10 | 1642543906250 |
11 | 583665239995 |
12 | 22640476a062 |
13 | bbb7803b570 |
14 | 596dca98042 |
15 | 2cad65badd5 |
hex | 17e6f3efdca |
1642543906250 has 64 divisors (see below), whose sum is σ = 3316670806176. Its totient is φ = 606477000000.
The previous prime is 1642543906217. The next prime is 1642543906259. The reversal of 1642543906250 is 526093452461.
It can be written as a sum of positive squares in 16 ways, for example, as 1573265981401 + 69277924849 = 1254299^2 + 263207^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1642543906195 and 1642543906204.
It is not an unprimeable number, because it can be changed into a prime (1642543906259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1626932 + ... + 2435568.
Almost surely, 21642543906250 is an apocalyptic number.
1642543906250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1642543906250 is an abundant number, since it is smaller than the sum of its proper divisors (1674126899926).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1642543906250 is an frugal number, since it uses more digits than its factorization.
1642543906250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 808687 (or 808657 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 1642543906250 in words is "one trillion, six hundred forty-two billion, five hundred forty-three million, nine hundred six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •