Base | Representation |
---|---|
bin | 101111000000111010001011… |
… | …1101110010001100111010101 |
3 | 2000020020011102220120020202212 |
4 | 1132001310113232101213111 |
5 | 413200430112432231401 |
6 | 4023310132301443205 |
7 | 153051242344440236 |
oct | 13601642756214725 |
9 | 2006204386506685 |
10 | 413541324102101 |
11 | 10a848988501388 |
12 | 3a46b0b4870505 |
13 | 14999a1982ca50 |
14 | 7419714c5708d |
15 | 32c225b281dbb |
hex | 1781d17b919d5 |
413541324102101 has 32 divisors (see below), whose sum is σ = 483920369587200. Its totient is φ = 349969055984640.
The previous prime is 413541324102089. The next prime is 413541324102169. The reversal of 413541324102101 is 101201423145314.
It is a cyclic number.
It is not a de Polignac number, because 413541324102101 - 214 = 413541324085717 is a prime.
It is a super-2 number, since 2×4135413241021012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (413541324102191) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 676090715 + ... + 676702103.
It is an arithmetic number, because the mean of its divisors is an integer number (15122511549600).
Almost surely, 2413541324102101 is an apocalyptic number.
It is an amenable number.
413541324102101 is a deficient number, since it is larger than the sum of its proper divisors (70379045485099).
413541324102101 is a wasteful number, since it uses less digits than its factorization.
413541324102101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 699789.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 413541324102101 its reverse (101201423145314), we get a palindrome (514742747247415).
The spelling of 413541324102101 in words is "four hundred thirteen trillion, five hundred forty-one billion, three hundred twenty-four million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •