Base | Representation |
---|---|
bin | 100101000100100101010010… |
… | …111001011100100010010101 |
3 | 210101021201120012202221102202 |
4 | 211010211102321130202111 |
5 | 132332242313421024021 |
6 | 1334432431244214245 |
7 | 46225304501213645 |
oct | 4504452271344225 |
9 | 711251505687382 |
10 | 163042644314261 |
11 | 47a4aaa7225488 |
12 | 1635290b83a385 |
13 | 6cc8b17393c7a |
14 | 2c3943dca8525 |
15 | 13cb1a77d3a0b |
hex | 944952e5c895 |
163042644314261 has 8 divisors (see below), whose sum is σ = 163873500034464. Its totient is φ = 162211821201360.
The previous prime is 163042644314191. The next prime is 163042644314267. The reversal of 163042644314261 is 162413446240361.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163042644314261 - 218 = 163042644052117 is a prime.
It is a super-2 number, since 2×1630426443142612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163042644314267) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1905566 + ... + 18158096.
It is an arithmetic number, because the mean of its divisors is an integer number (20484187504308).
Almost surely, 2163042644314261 is an apocalyptic number.
It is an amenable number.
163042644314261 is a deficient number, since it is larger than the sum of its proper divisors (830855720203).
163042644314261 is a wasteful number, since it uses less digits than its factorization.
163042644314261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16303651.
The product of its (nonzero) digits is 1990656, while the sum is 47.
The spelling of 163042644314261 in words is "one hundred sixty-three trillion, forty-two billion, six hundred forty-four million, three hundred fourteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •