Base | Representation |
---|---|
bin | 10010101101001000111011… |
… | …10101101011001001101001 |
3 | 12101122022111112111200111022 |
4 | 21112210131311223021221 |
5 | 20342412202003402213 |
6 | 223252231343142225 |
7 | 11443535025364454 |
oct | 1126443565531151 |
9 | 171568445450438 |
10 | 41133402403433 |
11 | 1211963a34715a |
12 | 4743b192a4975 |
13 | 19c4b2b5c28a2 |
14 | a22c1dc2249b |
15 | 4b4e92d76308 |
hex | 25691dd6b269 |
41133402403433 has 8 divisors (see below), whose sum is σ = 41712856333056. Its totient is φ = 40553951536000.
The previous prime is 41133402403417. The next prime is 41133402403447. The reversal of 41133402403433 is 33430420433114.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41133402403433 - 24 = 41133402403417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41133402403393 and 41133402403402.
It is not an unprimeable number, because it can be changed into a prime (41133402703433) 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, 48131408 + ... + 48978558.
It is an arithmetic number, because the mean of its divisors is an integer number (5214107041632).
Almost surely, 241133402403433 is an apocalyptic number.
It is an amenable number.
41133402403433 is a deficient number, since it is larger than the sum of its proper divisors (579453929623).
41133402403433 is an equidigital number, since it uses as much as digits as its factorization.
41133402403433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1531095.
The product of its (nonzero) digits is 124416, while the sum is 35.
Adding to 41133402403433 its reverse (33430420433114), we get a palindrome (74563822836547).
The spelling of 41133402403433 in words is "forty-one trillion, one hundred thirty-three billion, four hundred two million, four hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •