Base | Representation |
---|---|
bin | 1110110011010010010100… |
… | …0001101111100000101001 |
3 | 2010121210200121212001201112 |
4 | 3230310211001233200221 |
5 | 4113114132042021111 |
6 | 54340142134400105 |
7 | 3266530100052305 |
oct | 354644501574051 |
9 | 63553617761645 |
10 | 16274252298281 |
11 | 520496517633a |
12 | 19aa086200035 |
13 | 910869c0c053 |
14 | 40396c682d05 |
15 | 1d34e5e20e8b |
hex | ecd2506f829 |
16274252298281 has 2 divisors, whose sum is σ = 16274252298282. Its totient is φ = 16274252298280.
The previous prime is 16274252298229. The next prime is 16274252298287. The reversal of 16274252298281 is 18289225247261.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14247159760681 + 2027092537600 = 3774541^2 + 1423760^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16274252298281 is a prime.
It is a super-2 number, since 2×162742522982812 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16274252298281.
It is not a weakly prime, because it can be changed into another prime (16274252298287) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8137126149140 + 8137126149141.
It is an arithmetic number, because the mean of its divisors is an integer number (8137126149141).
Almost surely, 216274252298281 is an apocalyptic number.
It is an amenable number.
16274252298281 is a deficient number, since it is larger than the sum of its proper divisors (1).
16274252298281 is an equidigital number, since it uses as much as digits as its factorization.
16274252298281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15482880, while the sum is 59.
The spelling of 16274252298281 in words is "sixteen trillion, two hundred seventy-four billion, two hundred fifty-two million, two hundred ninety-eight thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •