Base | Representation |
---|---|
bin | 11011110011110110010111… |
… | …00110001110100101010101 |
3 | 22000112101011021000120022021 |
4 | 31321323023212032211111 |
5 | 31003431232000002001 |
6 | 334022143121333141 |
7 | 15611212610313655 |
oct | 1571731346164525 |
9 | 260471137016267 |
10 | 61155160156501 |
11 | 185388376620a4 |
12 | 6a383434971b1 |
13 | 2817ba349bb08 |
14 | 1115cd59a2365 |
15 | 710bbce38ba1 |
hex | 379ecb98e955 |
61155160156501 has 4 divisors (see below), whose sum is σ = 61155357927552. Its totient is φ = 61154962385452.
The previous prime is 61155160156463. The next prime is 61155160156511. The reversal of 61155160156501 is 10565106155116.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 61155160156501 - 229 = 61154623285589 is a prime.
It is a super-2 number, since 2×611551601565012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61155160156511) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98420965 + ... + 99040378.
It is an arithmetic number, because the mean of its divisors is an integer number (15288839481888).
Almost surely, 261155160156501 is an apocalyptic number.
It is an amenable number.
61155160156501 is a deficient number, since it is larger than the sum of its proper divisors (197771051).
61155160156501 is a wasteful number, since it uses less digits than its factorization.
61155160156501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197771050.
The product of its (nonzero) digits is 135000, while the sum is 43.
The spelling of 61155160156501 in words is "sixty-one trillion, one hundred fifty-five billion, one hundred sixty million, one hundred fifty-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •