Base | Representation |
---|---|
bin | 1001100001100101100… |
… | …0100000010011010101 |
3 | 120122100222101112112110 |
4 | 2120121120200103111 |
5 | 10140110430031123 |
6 | 203101145341233 |
7 | 14552006150640 |
oct | 2303130402325 |
9 | 518328345473 |
10 | 163634611413 |
11 | 63440521549 |
12 | 27868a97819 |
13 | 1257a277970 |
14 | 7cc4512a57 |
15 | 43caad9493 |
hex | 26196204d5 |
163634611413 has 32 divisors (see below), whose sum is σ = 269711640576. Its totient is φ = 85932497088.
The previous prime is 163634611391. The next prime is 163634611421. The reversal of 163634611413 is 314116436361.
It is not a de Polignac number, because 163634611413 - 29 = 163634610901 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163634611013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1258281 + ... + 1382222.
It is an arithmetic number, because the mean of its divisors is an integer number (8428488768).
Almost surely, 2163634611413 is an apocalyptic number.
163634611413 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
163634611413 is a deficient number, since it is larger than the sum of its proper divisors (106077029163).
163634611413 is a wasteful number, since it uses less digits than its factorization.
163634611413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2640753.
The product of its digits is 93312, while the sum is 39.
The spelling of 163634611413 in words is "one hundred sixty-three billion, six hundred thirty-four million, six hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •