Base | Representation |
---|---|
bin | 11110101110001010… |
… | …10100001000111010 |
3 | 1120120110020100121110 |
4 | 33113011110020322 |
5 | 232234302142123 |
6 | 11324342421150 |
7 | 1122502362123 |
oct | 172705241072 |
9 | 46513210543 |
10 | 16493396538 |
11 | 6aa4101a33 |
12 | 32437317b6 |
13 | 172b068748 |
14 | b266c904a |
15 | 667ea7493 |
hex | 3d715423a |
16493396538 has 32 divisors (see below), whose sum is σ = 35661407040. Its totient is φ = 5067671040.
The previous prime is 16493396537. The next prime is 16493396539. The reversal of 16493396538 is 83569339461.
It is a happy number.
16493396538 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (16493396537) and next prime (16493396539).
It is a Harshad number since it is a multiple of its sum of digits (57).
It is not an unprimeable number, because it can be changed into a prime (16493396537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1950903 + ... + 1959338.
It is an arithmetic number, because the mean of its divisors is an integer number (1114418970).
Almost surely, 216493396538 is an apocalyptic number.
16493396538 is an abundant number, since it is smaller than the sum of its proper divisors (19168010502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16493396538 is a wasteful number, since it uses less digits than its factorization.
16493396538 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3910302.
The product of its digits is 12597120, while the sum is 57.
The spelling of 16493396538 in words is "sixteen billion, four hundred ninety-three million, three hundred ninety-six thousand, five hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •