Base | Representation |
---|---|
bin | 1001011110000000110001… |
… | …1111100111011011011101 |
3 | 1100212022011011000220101020 |
4 | 2113200030133213123131 |
5 | 2331034124321340221 |
6 | 34050502145434353 |
7 | 2123120332512426 |
oct | 227401437473335 |
9 | 40768134026336 |
10 | 10411210340061 |
11 | 33544078a9873 |
12 | 120191933b9b9 |
13 | 5a6a08158a7b |
14 | 27dc960b664d |
15 | 130c45ac8ac6 |
hex | 9780c7e76dd |
10411210340061 has 8 divisors (see below), whose sum is σ = 14057330417280. Its totient is φ = 6852948578112.
The previous prime is 10411210340051. The next prime is 10411210340117. The reversal of 10411210340061 is 16004301211401.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10411210340061 - 29 = 10411210339549 is a prime.
It is a super-2 number, since 2×104112103400612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10411210340051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21964578540 + ... + 21964579013.
It is an arithmetic number, because the mean of its divisors is an integer number (1757166302160).
Almost surely, 210411210340061 is an apocalyptic number.
It is an amenable number.
10411210340061 is a deficient number, since it is larger than the sum of its proper divisors (3646120077219).
10411210340061 is an equidigital number, since it uses as much as digits as its factorization.
10411210340061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43929157635.
The product of its (nonzero) digits is 576, while the sum is 24.
Adding to 10411210340061 its reverse (16004301211401), we get a palindrome (26415511551462).
The spelling of 10411210340061 in words is "ten trillion, four hundred eleven billion, two hundred ten million, three hundred forty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •