Base | Representation |
---|---|
bin | 11101110110011000… |
… | …00010100111110101 |
3 | 1112100211121112221222 |
4 | 32323030002213311 |
5 | 230310000211444 |
6 | 11210103520125 |
7 | 1105060430144 |
oct | 167314024765 |
9 | 45324545858 |
10 | 16025397749 |
11 | 6883a12579 |
12 | 3132a59045 |
13 | 168510949a |
14 | ac04a375b |
15 | 63bd60eee |
hex | 3bb3029f5 |
16025397749 has 4 divisors (see below), whose sum is σ = 16297014720. Its totient is φ = 15753780780.
The previous prime is 16025397737. The next prime is 16025397793. The reversal of 16025397749 is 94779352061.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 16025397749 - 212 = 16025393653 is a prime.
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 16025397749.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16025397799) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135808397 + ... + 135808514.
It is an arithmetic number, because the mean of its divisors is an integer number (4074253680).
Almost surely, 216025397749 is an apocalyptic number.
It is an amenable number.
16025397749 is a deficient number, since it is larger than the sum of its proper divisors (271616971).
16025397749 is an equidigital number, since it uses as much as digits as its factorization.
16025397749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271616970.
The product of its (nonzero) digits is 2857680, while the sum is 53.
The spelling of 16025397749 in words is "sixteen billion, twenty-five million, three hundred ninety-seven thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •