Base | Representation |
---|---|
bin | 10010110101010010011110… |
… | …01000010010100110011001 |
3 | 12102122002020012121012202200 |
4 | 21122221033020102212121 |
5 | 20412004121433211213 |
6 | 224025015423320413 |
7 | 11503006466626665 |
oct | 1132511710224631 |
9 | 172562205535680 |
10 | 41413402241433 |
11 | 12217363a13752 |
12 | 478a240750109 |
13 | 1a153619babc1 |
14 | a325c2a398a5 |
15 | 4bc3ce786273 |
hex | 25aa4f212999 |
41413402241433 has 12 divisors (see below), whose sum is σ = 59823802209600. Its totient is φ = 27606884020056.
The previous prime is 41413402241369. The next prime is 41413402241467. The reversal of 41413402241433 is 33414220431414.
41413402241433 is a `hidden beast` number, since 4 + 1 + 4 + 1 + 3 + 402 + 241 + 4 + 3 + 3 = 666.
It is not a de Polignac number, because 41413402241433 - 26 = 41413402241369 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (41413402241033) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 170772733 + ... + 171015066.
It is an arithmetic number, because the mean of its divisors is an integer number (4985316850800).
Almost surely, 241413402241433 is an apocalyptic number.
It is an amenable number.
41413402241433 is a deficient number, since it is larger than the sum of its proper divisors (18410399968167).
41413402241433 is a wasteful number, since it uses less digits than its factorization.
41413402241433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 341801268 (or 341801265 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 36.
Adding to 41413402241433 its reverse (33414220431414), we get a palindrome (74827622672847).
The spelling of 41413402241433 in words is "forty-one trillion, four hundred thirteen billion, four hundred two million, two hundred forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •