Base | Representation |
---|---|
bin | 11101111001111000… |
… | …10100011010111101 |
3 | 1112102212222220111021 |
4 | 32330330110122331 |
5 | 230340014041111 |
6 | 11213034424141 |
7 | 1105565544553 |
oct | 167474243275 |
9 | 45385886437 |
10 | 16054830781 |
11 | 6899595aa0 |
12 | 3140892051 |
13 | 168b243392 |
14 | ac4365bd3 |
15 | 63e726d71 |
hex | 3bcf146bd |
16054830781 has 8 divisors (see below), whose sum is σ = 17516174400. Its totient is φ = 14593789440.
The previous prime is 16054830769. The next prime is 16054830793. The reversal of 16054830781 is 18703845061.
It is an interprime number because it is at equal distance from previous prime (16054830769) and next prime (16054830793).
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 16054830781 - 29 = 16054830269 is a prime.
It is a super-2 number, since 2×160548307812 (a number of 21 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 (16054830731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43680 + ... + 184438.
It is an arithmetic number, because the mean of its divisors is an integer number (2189521800).
Almost surely, 216054830781 is an apocalyptic number.
16054830781 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16054830781 is a deficient number, since it is larger than the sum of its proper divisors (1461343619).
16054830781 is a wasteful number, since it uses less digits than its factorization.
16054830781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151139.
The product of its (nonzero) digits is 161280, while the sum is 43.
The spelling of 16054830781 in words is "sixteen billion, fifty-four million, eight hundred thirty thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •