Base | Representation |
---|---|
bin | 10010110101110001011010… |
… | …00011011100000001000010 |
3 | 12102200200002122210202021122 |
4 | 21122320231003130001002 |
5 | 20412242130131204442 |
6 | 224040403430152242 |
7 | 11504135165022422 |
oct | 1132705503340102 |
9 | 172620078722248 |
10 | 41430010413122 |
11 | 12223406888981 |
12 | 47914b67b2682 |
13 | 1a16aaa771326 |
14 | a3331a680482 |
15 | 4bca52860dd2 |
hex | 25ae2d0dc042 |
41430010413122 has 8 divisors (see below), whose sum is σ = 65800604773836. Its totient is φ = 19496475488512.
The previous prime is 41430010412933. The next prime is 41430010413149. The reversal of 41430010413122 is 22131401003414.
It can be written as a sum of positive squares in 2 ways, for example, as 37131607532041 + 4298402881081 = 6093571^2 + 2073259^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×414300104131223 (a number of 42 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41430010413091 and 41430010413100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 609264858983 + ... + 609264859050.
Almost surely, 241430010413122 is an apocalyptic number.
41430010413122 is a deficient number, since it is larger than the sum of its proper divisors (24370594360714).
41430010413122 is a wasteful number, since it uses less digits than its factorization.
41430010413122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1218529718052.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 41430010413122 its reverse (22131401003414), we get a palindrome (63561411416536).
The spelling of 41430010413122 in words is "forty-one trillion, four hundred thirty billion, ten million, four hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •