Base | Representation |
---|---|
bin | 1001100001001011010… |
… | …0100001000101000100 |
3 | 120122002022020000102210 |
4 | 2120102310201011010 |
5 | 10134344233422431 |
6 | 203042213503420 |
7 | 14546201302365 |
oct | 2302264410504 |
9 | 518068200383 |
10 | 163524514116 |
11 | 63394363847 |
12 | 27838041b70 |
13 | 1256050a232 |
14 | 7cb3a53b6c |
15 | 43c10dcd46 |
hex | 2612d21144 |
163524514116 has 12 divisors (see below), whose sum is σ = 381557199632. Its totient is φ = 54508171368.
The previous prime is 163524514091. The next prime is 163524514129. The reversal of 163524514116 is 611415425361.
163524514116 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×1635245141162 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6813521410 + ... + 6813521433.
Almost surely, 2163524514116 is an apocalyptic number.
It is an amenable number.
163524514116 is an abundant number, since it is smaller than the sum of its proper divisors (218032685516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163524514116 is a wasteful number, since it uses less digits than its factorization.
163524514116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13627042850 (or 13627042848 counting only the distinct ones).
The product of its digits is 86400, while the sum is 39.
Adding to 163524514116 its reverse (611415425361), we get a palindrome (774939939477).
The spelling of 163524514116 in words is "one hundred sixty-three billion, five hundred twenty-four million, five hundred fourteen thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •