Base | Representation |
---|---|
bin | 101100011011010110001… |
… | …0110111110101001011111 |
3 | 210121201202102221111111100 |
4 | 1120312230112332221133 |
5 | 1300020132244420133 |
6 | 20553024241124143 |
7 | 1200101240422116 |
oct | 130665426765137 |
9 | 23551672844440 |
10 | 6106040232543 |
11 | 1a44614588679 |
12 | 827484629653 |
13 | 353a49383924 |
14 | 171769132c7d |
15 | a8c73605e13 |
hex | 58dac5bea5f |
6106040232543 has 24 divisors (see below), whose sum is σ = 9124144894800. Its totient is φ = 3930248617344.
The previous prime is 6106040232521. The next prime is 6106040232547. The reversal of 6106040232543 is 3452320406016.
6106040232543 is a `hidden beast` number, since 6 + 1 + 0 + 604 + 0 + 2 + 3 + 2 + 5 + 43 = 666.
It is not a de Polignac number, because 6106040232543 - 212 = 6106040228447 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6106040232498 and 6106040232507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6106040232547) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15310968 + ... + 15704706.
It is an arithmetic number, because the mean of its divisors is an integer number (380172703950).
Almost surely, 26106040232543 is an apocalyptic number.
6106040232543 is a deficient number, since it is larger than the sum of its proper divisors (3018104662257).
6106040232543 is a wasteful number, since it uses less digits than its factorization.
6106040232543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 453191 (or 453188 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
Adding to 6106040232543 its reverse (3452320406016), we get a palindrome (9558360638559).
The spelling of 6106040232543 in words is "six trillion, one hundred six billion, forty million, two hundred thirty-two thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •