Base | Representation |
---|---|
bin | 1001110011101100101… |
… | …1000110010100100000 |
3 | 121002220210212112210212 |
4 | 2130323023012110200 |
5 | 10230040100133020 |
6 | 205223424313252 |
7 | 15113333350244 |
oct | 2347313062440 |
9 | 532823775725 |
10 | 168496489760 |
11 | 6550596a725 |
12 | 287a5172828 |
13 | 12b73606161 |
14 | 82260dc424 |
15 | 45b285acc5 |
hex | 273b2c6520 |
168496489760 has 24 divisors (see below), whose sum is σ = 398072957436. Its totient is φ = 67398595840.
The previous prime is 168496489741. The next prime is 168496489769. The reversal of 168496489760 is 67984694861.
It can be written as a sum of positive squares in 2 ways, for example, as 167578884496 + 917605264 = 409364^2 + 30292^2 .
It is a super-2 number, since 2×1684964897602 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (168496489769) 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 3 ways as a sum of consecutive naturals, for example, 526551371 + ... + 526551690.
Almost surely, 2168496489760 is an apocalyptic number.
168496489760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
168496489760 is an abundant number, since it is smaller than the sum of its proper divisors (229576467676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
168496489760 is a wasteful number, since it uses less digits than its factorization.
168496489760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053103076 (or 1053103068 counting only the distinct ones).
The product of its (nonzero) digits is 125411328, while the sum is 68.
The spelling of 168496489760 in words is "one hundred sixty-eight billion, four hundred ninety-six million, four hundred eighty-nine thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •