Base | Representation |
---|---|
bin | 11110011001000010… |
… | …01101110100010101 |
3 | 1120010002201212120102 |
4 | 33030201031310111 |
5 | 231403414130201 |
6 | 11255011543445 |
7 | 1115221040246 |
oct | 171441156425 |
9 | 46102655512 |
10 | 16316161301 |
11 | 6a13058530 |
12 | 31b42bab85 |
13 | 170042211b |
14 | b0ad50ccd |
15 | 65764826b |
hex | 3cc84dd15 |
16316161301 has 8 divisors (see below), whose sum is σ = 17809353408. Its totient is φ = 14824620000.
The previous prime is 16316161259. The next prime is 16316161357. The reversal of 16316161301 is 10316161361.
16316161301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16316161301 - 210 = 16316160277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16316161501) 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 7 ways as a sum of consecutive naturals, for example, 391985 + ... + 431606.
It is an arithmetic number, because the mean of its divisors is an integer number (2226169176).
Almost surely, 216316161301 is an apocalyptic number.
16316161301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16316161301 is a deficient number, since it is larger than the sum of its proper divisors (1493192107).
16316161301 is a wasteful number, since it uses less digits than its factorization.
16316161301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 825403.
The product of its (nonzero) digits is 1944, while the sum is 29.
The spelling of 16316161301 in words is "sixteen billion, three hundred sixteen million, one hundred sixty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •