Base | Representation |
---|---|
bin | 10010110101001111111001… |
… | …11000100111101111011101 |
3 | 12102121221200001012002220222 |
4 | 21122213330320213233131 |
5 | 20411443310213331023 |
6 | 224024230452451125 |
7 | 11502630343322354 |
oct | 1132477470475735 |
9 | 172557601162828 |
10 | 41412022402013 |
11 | 1221681604499a |
12 | 4789b16619aa5 |
13 | 1a151a1b7a983 |
14 | a324d169499b |
15 | 4bc34d574cc8 |
hex | 25a9fce27bdd |
41412022402013 has 8 divisors (see below), whose sum is σ = 43214352913536. Its totient is φ = 39609842540400.
The previous prime is 41412022401983. The next prime is 41412022402063. The reversal of 41412022402013 is 31020422021414.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41412022402013 - 222 = 41412018207709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41412022402063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37100558 + ... + 38200463.
It is an arithmetic number, because the mean of its divisors is an integer number (5401794114192).
Almost surely, 241412022402013 is an apocalyptic number.
It is an amenable number.
41412022402013 is a deficient number, since it is larger than the sum of its proper divisors (1802330511523).
41412022402013 is a wasteful number, since it uses less digits than its factorization.
41412022402013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75324955.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 41412022402013 its reverse (31020422021414), we get a palindrome (72432444423427).
The spelling of 41412022402013 in words is "forty-one trillion, four hundred twelve billion, twenty-two million, four hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •