Base | Representation |
---|---|
bin | 11011101111010101100010… |
… | …10010101011001100011111 |
3 | 21222222112220211222111102002 |
4 | 31313222301102223030133 |
5 | 30443411201100004133 |
6 | 333423020432152515 |
7 | 15564053225611304 |
oct | 1567526122531437 |
9 | 258875824874362 |
10 | 61000100000543 |
11 | 18488aa71a9980 |
12 | 6a1228a09873b |
13 | 280639178ab42 |
14 | 110c5c61710ab |
15 | 70bb44ebdce8 |
hex | 377ab14ab31f |
61000100000543 has 4 divisors (see below), whose sum is σ = 66545563636968. Its totient is φ = 55454636364120.
The previous prime is 61000100000527. The next prime is 61000100000557. The reversal of 61000100000543 is 34500000100016.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 61000100000543 - 24 = 61000100000527 is a prime.
It is a super-2 number, since 2×610001000005432 (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 (61000100000503) 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, 2772731818196 + ... + 2772731818217.
It is an arithmetic number, because the mean of its divisors is an integer number (16636390909242).
Almost surely, 261000100000543 is an apocalyptic number.
61000100000543 is a deficient number, since it is larger than the sum of its proper divisors (5545463636425).
61000100000543 is a wasteful number, since it uses less digits than its factorization.
61000100000543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5545463636424.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 61000100000543 its reverse (34500000100016), we get a palindrome (95500100100559).
The spelling of 61000100000543 in words is "sixty-one trillion, one hundred million, five hundred forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •