Base | Representation |
---|---|
bin | 100101001000011010000011… |
… | …001101101010101010000100 |
3 | 210102012211220110010200112011 |
4 | 211020122003031222222010 |
5 | 132401044024132121104 |
6 | 1335153253113504004 |
7 | 46253300144110000 |
oct | 4510320315525204 |
9 | 712184813120464 |
10 | 163305447926404 |
11 | 480414a6a98a73 |
12 | 16395834112004 |
13 | 7017839c33704 |
14 | 2c48050d23700 |
15 | 13d2e396aa904 |
hex | 94868336aa84 |
163305447926404 has 45 divisors (see below), whose sum is σ = 333398008386807. Its totient is φ = 69987512389032.
The previous prime is 163305447926399. The next prime is 163305447926471. The reversal of 163305447926404 is 404629744503361.
The square root of 163305447926404 is 12779102.
It is a perfect power (a square), and thus also a powerful number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 1252286797 + ... + 1252417195.
Almost surely, 2163305447926404 is an apocalyptic number.
163305447926404 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
163305447926404 is the 12779102-nd square number.
It is an amenable number.
163305447926404 is an abundant number, since it is smaller than the sum of its proper divisors (170092560460403).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163305447926404 is an frugal number, since it uses more digits than its factorization.
163305447926404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260830 (or 130408 counting only the distinct ones).
The product of its (nonzero) digits is 52254720, while the sum is 58.
The spelling of 163305447926404 in words is "one hundred sixty-three trillion, three hundred five billion, four hundred forty-seven million, nine hundred twenty-six thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •