Base | Representation |
---|---|
bin | 100101000100110000010111… |
… | …100111101011110000000100 |
3 | 210101022212020212122022221210 |
4 | 211010300113213223300010 |
5 | 132332441141341013012 |
6 | 1334442115200411420 |
7 | 46226205241651431 |
oct | 4504602747536004 |
9 | 711285225568853 |
10 | 163054534704132 |
11 | 47a55049021375 |
12 | 16355089916b70 |
13 | 6cc9c908cba16 |
14 | 2c39c4b112b88 |
15 | 13cb65160223c |
hex | 944c179ebc04 |
163054534704132 has 24 divisors (see below), whose sum is σ = 380461250244096. Its totient is φ = 54351415958368.
The previous prime is 163054534704043. The next prime is 163054534704137. The reversal of 163054534704132 is 231407435450361.
It is a super-3 number, since 3×1630545347041323 (a number of 44 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (163054534704137) 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, 4667748 + ... + 18651995.
It is an arithmetic number, because the mean of its divisors is an integer number (15852552093504).
Almost surely, 2163054534704132 is an apocalyptic number.
163054534704132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
163054534704132 is an abundant number, since it is smaller than the sum of its proper divisors (217406715539964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163054534704132 is a wasteful number, since it uses less digits than its factorization.
163054534704132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23902427 (or 23902425 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 48.
The spelling of 163054534704132 in words is "one hundred sixty-three trillion, fifty-four billion, five hundred thirty-four million, seven hundred four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •