Base | Representation |
---|---|
bin | 111110010010… |
… | …110110001010 |
3 | 1010201122201100 |
4 | 332102312022 |
5 | 13140030442 |
6 | 1342002230 |
7 | 255542454 |
oct | 76226612 |
9 | 33648640 |
10 | 16330122 |
11 | 9244076 |
12 | 5576376 |
13 | 34c9bc3 |
14 | 22512d4 |
15 | 167884c |
hex | f92d8a |
16330122 has 12 divisors (see below), whose sum is σ = 35381970. Its totient is φ = 5443368.
The previous prime is 16330109. The next prime is 16330123. The reversal of 16330122 is 22103361.
It can be written as a sum of positive squares in only one way, i.e., 16329681 + 441 = 4041^2 + 21^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 907229 = 16330122 / (1 + 6 + 3 + 3 + 0 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 16330095 and 16330104.
It is not an unprimeable number, because it can be changed into a prime (16330123) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 453597 + ... + 453632.
Almost surely, 216330122 is an apocalyptic number.
16330122 is an abundant number, since it is smaller than the sum of its proper divisors (19051848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16330122 is a wasteful number, since it uses less digits than its factorization.
16330122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 907237 (or 907234 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 16330122 is about 4041.0545653332. The cubic root of 16330122 is about 253.7054576544.
Adding to 16330122 its reverse (22103361), we get a palindrome (38433483).
The spelling of 16330122 in words is "sixteen million, three hundred thirty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •