Base | Representation |
---|---|
bin | 101100110010100110110… |
… | …0110100110101000111101 |
3 | 210210111200112102200221101 |
4 | 1121211031212212220331 |
5 | 1301324431431204131 |
6 | 21032004532133101 |
7 | 1203520113330331 |
oct | 131451546465075 |
9 | 23714615380841 |
10 | 6155990100541 |
11 | 1a63816a1a816 |
12 | 8350a4767191 |
13 | 358679920138 |
14 | 173d46d337c1 |
15 | aa1e8896c61 |
hex | 5994d9a6a3d |
6155990100541 has 2 divisors, whose sum is σ = 6155990100542. Its totient is φ = 6155990100540.
The previous prime is 6155990100509. The next prime is 6155990100577. The reversal of 6155990100541 is 1450010995516.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4324715364025 + 1831274736516 = 2079595^2 + 1353246^2 .
It is a cyclic number.
It is not a de Polignac number, because 6155990100541 - 25 = 6155990100509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6155990100491 and 6155990100500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6155990140541) 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, 3077995050270 + 3077995050271.
It is an arithmetic number, because the mean of its divisors is an integer number (3077995050271).
Almost surely, 26155990100541 is an apocalyptic number.
It is an amenable number.
6155990100541 is a deficient number, since it is larger than the sum of its proper divisors (1).
6155990100541 is an equidigital number, since it uses as much as digits as its factorization.
6155990100541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243000, while the sum is 46.
The spelling of 6155990100541 in words is "six trillion, one hundred fifty-five billion, nine hundred ninety million, one hundred thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •