Base | Representation |
---|---|
bin | 11110111100111001… |
… | …00001111101011101 |
3 | 1120220001200011000121 |
4 | 33132130201331131 |
5 | 233012413013343 |
6 | 11344514154541 |
7 | 1125532341400 |
oct | 173634417535 |
9 | 46801604017 |
10 | 16616922973 |
11 | 70579021a2 |
12 | 3278b82a51 |
13 | 174a828801 |
14 | b38c81d37 |
15 | 673c57aed |
hex | 3de721f5d |
16616922973 has 6 divisors (see below), whose sum is σ = 19329890046. Its totient is φ = 14243076792.
The previous prime is 16616922943. The next prime is 16616922983. The reversal of 16616922973 is 37922961661.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 16099041924 + 517881049 = 126882^2 + 22757^2 .
It is not a de Polignac number, because 16616922973 - 25 = 16616922941 is a prime.
It is a super-2 number, since 2×166169229732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16616922973.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16616922943) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 169560390 + ... + 169560487.
It is an arithmetic number, because the mean of its divisors is an integer number (3221648341).
Almost surely, 216616922973 is an apocalyptic number.
It is an amenable number.
16616922973 is a deficient number, since it is larger than the sum of its proper divisors (2712967073).
16616922973 is an equidigital number, since it uses as much as digits as its factorization.
16616922973 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339120891 (or 339120884 counting only the distinct ones).
The product of its digits is 1469664, while the sum is 52.
The spelling of 16616922973 in words is "sixteen billion, six hundred sixteen million, nine hundred twenty-two thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •