Base | Representation |
---|---|
bin | 11011110010001111101100… |
… | …01111011111110100111101 |
3 | 22000100002212220200111110202 |
4 | 31321013312033133310331 |
5 | 31002030341001341021 |
6 | 333540545451413245 |
7 | 15604221655504553 |
oct | 1571076617376475 |
9 | 260302786614422 |
10 | 61100041043261 |
11 | 18517422326550 |
12 | 6a29720154225 |
13 | 281292acc70cc |
14 | 1113387445bd3 |
15 | 70e543e5ea0b |
hex | 3791f63dfd3d |
61100041043261 has 16 divisors (see below), whose sum is σ = 69449089348800. Its totient is φ = 53244301756800.
The previous prime is 61100041043243. The next prime is 61100041043269. The reversal of 61100041043261 is 16234014000116.
It is not a de Polignac number, because 61100041043261 - 226 = 61099973934397 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61100041043269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 688934720 + ... + 689023401.
It is an arithmetic number, because the mean of its divisors is an integer number (4340568084300).
Almost surely, 261100041043261 is an apocalyptic number.
It is an amenable number.
61100041043261 is a deficient number, since it is larger than the sum of its proper divisors (8349048305539).
61100041043261 is a wasteful number, since it uses less digits than its factorization.
61100041043261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1377958300.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 61100041043261 its reverse (16234014000116), we get a palindrome (77334055043377).
The spelling of 61100041043261 in words is "sixty-one trillion, one hundred billion, forty-one million, forty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •