Base | Representation |
---|---|
bin | 1111001010110000000000… |
… | …1011111010010111100111 |
3 | 2012001100011222020121021010 |
4 | 3302230000023322113213 |
5 | 4141220213422224111 |
6 | 55245250211553303 |
7 | 3340620361445424 |
oct | 362540013722747 |
9 | 65040158217233 |
10 | 16677361133031 |
11 | 534a913644255 |
12 | 1a542265bb833 |
13 | 93c88c649781 |
14 | 41928d69cd4b |
15 | 1ddc3a70aaa6 |
hex | f2b002fa5e7 |
16677361133031 has 4 divisors (see below), whose sum is σ = 22236481510712. Its totient is φ = 11118240755352.
The previous prime is 16677361133021. The next prime is 16677361133039. The reversal of 16677361133031 is 13033116377661.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 16677361133031 - 222 = 16677356938727 is a prime.
It is a super-2 number, since 2×166773611330312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16677361133039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2779560188836 + ... + 2779560188841.
It is an arithmetic number, because the mean of its divisors is an integer number (5559120377678).
Almost surely, 216677361133031 is an apocalyptic number.
16677361133031 is a deficient number, since it is larger than the sum of its proper divisors (5559120377681).
16677361133031 is an equidigital number, since it uses as much as digits as its factorization.
16677361133031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5559120377680.
The product of its (nonzero) digits is 857304, while the sum is 48.
The spelling of 16677361133031 in words is "sixteen trillion, six hundred seventy-seven billion, three hundred sixty-one million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •