Base | Representation |
---|---|
bin | 1111001000000000000110… |
… | …0010010111100000100001 |
3 | 2011212211021222202122102212 |
4 | 3302000001202113200201 |
5 | 4134432011111002023 |
6 | 55211440325051505 |
7 | 3334326231330461 |
oct | 362000142274041 |
9 | 64784258678385 |
10 | 16630139156513 |
11 | 5331891009383 |
12 | 1a47047b56b95 |
13 | 9382a52b102c |
14 | 416c8dcb1ba1 |
15 | 1dc8c4bade78 |
hex | f2001897821 |
16630139156513 has 4 divisors (see below), whose sum is σ = 17166595258368. Its totient is φ = 16093683054660.
The previous prime is 16630139156509. The next prime is 16630139156563. The reversal of 16630139156513 is 31565193103661.
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 16630139156513 - 22 = 16630139156509 is a prime.
It is a super-2 number, since 2×166301391565132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16630139156503) 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, 268228050881 + ... + 268228050942.
It is an arithmetic number, because the mean of its divisors is an integer number (4291648814592).
Almost surely, 216630139156513 is an apocalyptic number.
It is an amenable number.
16630139156513 is a deficient number, since it is larger than the sum of its proper divisors (536456101855).
16630139156513 is an equidigital number, since it uses as much as digits as its factorization.
16630139156513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536456101854.
The product of its (nonzero) digits is 1312200, while the sum is 50.
The spelling of 16630139156513 in words is "sixteen trillion, six hundred thirty billion, one hundred thirty-nine million, one hundred fifty-six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •