Base | Representation |
---|---|
bin | 10011011100101… |
… | …01010001000000 |
3 | 102100222101221010 |
4 | 21232111101000 |
5 | 313231000142 |
6 | 24104400520 |
7 | 4020446532 |
oct | 1156252100 |
9 | 370871833 |
10 | 163140672 |
11 | 840a8002 |
12 | 46776140 |
13 | 27a50156 |
14 | 17949852 |
15 | e4c7e9c |
hex | 9b95440 |
163140672 has 28 divisors (see below), whose sum is σ = 431643536. Its totient is φ = 54380160.
The previous prime is 163140661. The next prime is 163140673. The reversal of 163140672 is 276041361.
163140672 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1631406723 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (163140673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 424654 + ... + 425037.
Almost surely, 2163140672 is an apocalyptic number.
163140672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
163140672 is an abundant number, since it is smaller than the sum of its proper divisors (268502864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
163140672 is an equidigital number, since it uses as much as digits as its factorization.
163140672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 849706 (or 849696 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 163140672 is about 12772.6532873949. The cubic root of 163140672 is about 546.4126548106.
The spelling of 163140672 in words is "one hundred sixty-three million, one hundred forty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •