Base | Representation |
---|---|
bin | 10011011100001… |
… | …01000010101111 |
3 | 102100212000210001 |
4 | 21232011002233 |
5 | 313221333343 |
6 | 24103125131 |
7 | 4020052024 |
oct | 1156050257 |
9 | 370760701 |
10 | 163074223 |
11 | 84062094 |
12 | 467437a7 |
13 | 27a28b30 |
14 | 1792d54b |
15 | e4b344d |
hex | 9b850af |
163074223 has 8 divisors (see below), whose sum is σ = 177003008. Its totient is φ = 149343264.
The previous prime is 163074203. The next prime is 163074227. The reversal of 163074223 is 322470361.
163074223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 163074223 - 29 = 163073711 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 163074191 and 163074200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (163074227) 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, 47736 + ... + 51037.
It is an arithmetic number, because the mean of its divisors is an integer number (22125376).
Almost surely, 2163074223 is an apocalyptic number.
163074223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
163074223 is a deficient number, since it is larger than the sum of its proper divisors (13928785).
163074223 is a wasteful number, since it uses less digits than its factorization.
163074223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98913.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 163074223 is about 12770.0518009913. The cubic root of 163074223 is about 546.3384580968.
The spelling of 163074223 in words is "one hundred sixty-three million, seventy-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •