Base | Representation |
---|---|
bin | 1110101110101111111010… |
… | …0010010101101110000001 |
3 | 2010100100110210102201200001 |
4 | 3223223332202111232001 |
5 | 4110330004030330031 |
6 | 54240250504400001 |
7 | 3261100225014031 |
oct | 353537642255601 |
9 | 63310423381601 |
10 | 16196297120641 |
11 | 51848a15405a0 |
12 | 1996b4b176001 |
13 | 9063c56160c1 |
14 | 3ddc9530d8c1 |
15 | 1d148221a861 |
hex | ebafe895b81 |
16196297120641 has 4 divisors (see below), whose sum is σ = 17668687767984. Its totient is φ = 14723906473300.
The previous prime is 16196297120533. The next prime is 16196297120657. The reversal of 16196297120641 is 14602179269161.
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 16196297120641 - 223 = 16196288732033 is a prime.
It is not an unprimeable number, because it can be changed into a prime (16196297120441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 736195323655 + ... + 736195323676.
It is an arithmetic number, because the mean of its divisors is an integer number (4417171941996).
Almost surely, 216196297120641 is an apocalyptic number.
16196297120641 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16196297120641 is a deficient number, since it is larger than the sum of its proper divisors (1472390647343).
16196297120641 is a wasteful number, since it uses less digits than its factorization.
16196297120641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472390647342.
The product of its (nonzero) digits is 1959552, while the sum is 55.
The spelling of 16196297120641 in words is "sixteen trillion, one hundred ninety-six billion, two hundred ninety-seven million, one hundred twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •