Base | Representation |
---|---|
bin | 10011011110001… |
… | …11001011100101 |
3 | 102101100210101110 |
4 | 21233013023211 |
5 | 313304021000 |
6 | 24113015233 |
7 | 4022260566 |
oct | 1157071345 |
9 | 371323343 |
10 | 163345125 |
11 | 84227679 |
12 | 46854519 |
13 | 27ac2228 |
14 | 179a016d |
15 | e518850 |
hex | 9bc72e5 |
163345125 has 32 divisors (see below), whose sum is σ = 274510080. Its totient is φ = 86251200.
The previous prime is 163345123. The next prime is 163345151. The reversal of 163345125 is 521543361.
It is not a de Polignac number, because 163345125 - 21 = 163345123 is a prime.
It is a super-2 number, since 2×1633451252 = 53363259722531250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 163345092 and 163345101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163345123) 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, 36511 + ... + 40739.
It is an arithmetic number, because the mean of its divisors is an integer number (8578440).
Almost surely, 2163345125 is an apocalyptic number.
163345125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
163345125 is a deficient number, since it is larger than the sum of its proper divisors (111164955).
163345125 is a wasteful number, since it uses less digits than its factorization.
163345125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4350 (or 4340 counting only the distinct ones).
The product of its digits is 10800, while the sum is 30.
The square root of 163345125 is about 12780.6543259725. The cubic root of 163345125 is about 546.6408200071.
Adding to 163345125 its reverse (521543361), we get a palindrome (684888486).
The spelling of 163345125 in words is "one hundred sixty-three million, three hundred forty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •