Base | Representation |
---|---|
bin | 100101001010010001110100… |
… | …010001110001010110000101 |
3 | 210102200010211200210010121202 |
4 | 211022101310101301112011 |
5 | 132410200411332104023 |
6 | 1335332321524352245 |
7 | 46265502011560466 |
oct | 4512216421612605 |
9 | 712603750703552 |
10 | 163434046363013 |
11 | 48090a98500848 |
12 | 163b6743545685 |
13 | 70269c262cc9a |
14 | 2c503701d0d6d |
15 | 13d646446b128 |
hex | 94a474471585 |
163434046363013 has 8 divisors (see below), whose sum is σ = 163467311941440. Its totient is φ = 163400781812800.
The previous prime is 163434046363009. The next prime is 163434046363033. The reversal of 163434046363013 is 310363640434361.
It is a happy number.
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 163434046363013 - 22 = 163434046363009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163434046363033) 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, 371883581 + ... + 372322797.
It is an arithmetic number, because the mean of its divisors is an integer number (20433413992680).
Almost surely, 2163434046363013 is an apocalyptic number.
It is an amenable number.
163434046363013 is a deficient number, since it is larger than the sum of its proper divisors (33265578427).
163434046363013 is an equidigital number, since it uses as much as digits as its factorization.
163434046363013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 514107.
The product of its (nonzero) digits is 3359232, while the sum is 47.
Adding to 163434046363013 its reverse (310363640434361), we get a palindrome (473797686797374).
The spelling of 163434046363013 in words is "one hundred sixty-three trillion, four hundred thirty-four billion, forty-six million, three hundred sixty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •