Base | Representation |
---|---|
bin | 111010101100000011111… |
… | …011100101001010111100 |
3 | 112021112222111201212101101 |
4 | 322230003323211022330 |
5 | 1012034131300210330 |
6 | 12324430401022444 |
7 | 564243332266255 |
oct | 72540373451274 |
9 | 15245874655341 |
10 | 4033040241340 |
11 | 1315448090a50 |
12 | 551769024a24 |
13 | 233410cc46b6 |
14 | dd2b3467b2c |
15 | 6ed969764ca |
hex | 3ab03ee52bc |
4033040241340 has 96 divisors (see below), whose sum is σ = 9890450438400. Its totient is φ = 1365823941120.
The previous prime is 4033040241337. The next prime is 4033040241341. The reversal of 4033040241340 is 431420403304.
It is a junction number, because it is equal to n+sod(n) for n = 4033040241299 and 4033040241308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4033040241341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7930009 + ... + 8423248.
It is an arithmetic number, because the mean of its divisors is an integer number (103025525400).
Almost surely, 24033040241340 is an apocalyptic number.
It is an amenable number.
4033040241340 is an abundant number, since it is smaller than the sum of its proper divisors (5857410197060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4033040241340 is a wasteful number, since it uses less digits than its factorization.
4033040241340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16353355 (or 16353353 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 4033040241340 its reverse (431420403304), we get a palindrome (4464460644644).
The spelling of 4033040241340 in words is "four trillion, thirty-three billion, forty million, two hundred forty-one thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •