Base | Representation |
---|---|
bin | 1110101010011100000101… |
… | …0011011000101110111101 |
3 | 2010002021100200202220011101 |
4 | 3222213001103120232331 |
5 | 4103121334332042441 |
6 | 54142243432253101 |
7 | 3252536342223454 |
oct | 352470123305675 |
9 | 63067320686141 |
10 | 16122255346621 |
11 | 5156456922916 |
12 | 1984726841191 |
13 | 8cc425a11bb8 |
14 | 3da46d9cbb9b |
15 | 1ce59bd82231 |
hex | ea9c14d8bbd |
16122255346621 has 2 divisors, whose sum is σ = 16122255346622. Its totient is φ = 16122255346620.
The previous prime is 16122255346609. The next prime is 16122255346649. The reversal of 16122255346621 is 12664355222161.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14767196381721 + 1355058964900 = 3842811^2 + 1164070^2 .
It is an emirp because it is prime and its reverse (12664355222161) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16122255346621 - 213 = 16122255338429 is a prime.
It is a super-2 number, since 2×161222553466212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16122255346721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8061127673310 + 8061127673311.
It is an arithmetic number, because the mean of its divisors is an integer number (8061127673311).
Almost surely, 216122255346621 is an apocalyptic number.
It is an amenable number.
16122255346621 is a deficient number, since it is larger than the sum of its proper divisors (1).
16122255346621 is an equidigital number, since it uses as much as digits as its factorization.
16122255346621 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1036800, while the sum is 46.
The spelling of 16122255346621 in words is "sixteen trillion, one hundred twenty-two billion, two hundred fifty-five million, three hundred forty-six thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •