Base | Representation |
---|---|
bin | 11101110011110101… |
… | …01110010111110101 |
3 | 1112022100111120001222 |
4 | 32321322232113311 |
5 | 230234021044031 |
6 | 11204023000125 |
7 | 1104411305456 |
oct | 167172562765 |
9 | 45270446058 |
10 | 16004081141 |
11 | 6872983044 |
12 | 3127899045 |
13 | 16808849c9 |
14 | abb71512d |
15 | 63a04ee7b |
hex | 3b9eae5f5 |
16004081141 has 2 divisors, whose sum is σ = 16004081142. Its totient is φ = 16004081140.
The previous prime is 16004081123. The next prime is 16004081147. The reversal of 16004081141 is 14118040061.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8771259025 + 7232822116 = 93655^2 + 85046^2 .
It is a cyclic number.
It is not a de Polignac number, because 16004081141 - 26 = 16004081077 is a prime.
It is a super-2 number, since 2×160040811412 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 16004081141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16004081147) 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 as a sum of consecutive naturals, namely, 8002040570 + 8002040571.
It is an arithmetic number, because the mean of its divisors is an integer number (8002040571).
Almost surely, 216004081141 is an apocalyptic number.
It is an amenable number.
16004081141 is a deficient number, since it is larger than the sum of its proper divisors (1).
16004081141 is an equidigital number, since it uses as much as digits as its factorization.
16004081141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 26.
The spelling of 16004081141 in words is "sixteen billion, four million, eighty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •