Base | Representation |
---|---|
bin | 1110110010001010110011… |
… | …0001111100010011011001 |
3 | 2010112222010201210100101222 |
4 | 3230202230301330103121 |
5 | 4112310323041140043 |
6 | 54323245202221425 |
7 | 3265250262642545 |
oct | 354425461742331 |
9 | 63488121710358 |
10 | 16255055021273 |
11 | 51a7803877a52 |
12 | 19a6409054875 |
13 | 90baca92b843 |
14 | 402a6ac34a25 |
15 | 1d2c708b8d68 |
hex | ec8acc7c4d9 |
16255055021273 has 2 divisors, whose sum is σ = 16255055021274. Its totient is φ = 16255055021272.
The previous prime is 16255055021269. The next prime is 16255055021339. The reversal of 16255055021273 is 37212055055261.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12711877498384 + 3543177522889 = 3565372^2 + 1882333^2 .
It is a cyclic number.
It is not a de Polignac number, because 16255055021273 - 22 = 16255055021269 is a prime.
It is a super-2 number, since 2×162550550212732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16255055021263) 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, 8127527510636 + 8127527510637.
It is an arithmetic number, because the mean of its divisors is an integer number (8127527510637).
Almost surely, 216255055021273 is an apocalyptic number.
It is an amenable number.
16255055021273 is a deficient number, since it is larger than the sum of its proper divisors (1).
16255055021273 is an equidigital number, since it uses as much as digits as its factorization.
16255055021273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630000, while the sum is 44.
The spelling of 16255055021273 in words is "sixteen trillion, two hundred fifty-five billion, fifty-five million, twenty-one thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •