Base | Representation |
---|---|
bin | 100011100000100011010… |
… | …001110101111111101101 |
3 | 22122021102002022022120201 |
4 | 203200203101311333231 |
5 | 304434343111214201 |
6 | 5104552021113501 |
7 | 341202530602120 |
oct | 43404321657755 |
9 | 8567362268521 |
10 | 2440133304301 |
11 | 8609446aa770 |
12 | 334ab7858891 |
13 | 149146759744 |
14 | 86162c003b7 |
15 | 43717e40801 |
hex | 23823475fed |
2440133304301 has 16 divisors (see below), whose sum is σ = 3042959845248. Its totient is φ = 1900955246400.
The previous prime is 2440133304277. The next prime is 2440133304311. The reversal of 2440133304301 is 1034033310442.
It is not a de Polignac number, because 2440133304301 - 27 = 2440133304173 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2440133304301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2440133304311) 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 15 ways as a sum of consecutive naturals, for example, 3398130 + ... + 4053091.
It is an arithmetic number, because the mean of its divisors is an integer number (190184990328).
Almost surely, 22440133304301 is an apocalyptic number.
It is an amenable number.
2440133304301 is a deficient number, since it is larger than the sum of its proper divisors (602826540947).
2440133304301 is a wasteful number, since it uses less digits than its factorization.
2440133304301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7455492.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 2440133304301 its reverse (1034033310442), we get a palindrome (3474166614743).
The spelling of 2440133304301 in words is "two trillion, four hundred forty billion, one hundred thirty-three million, three hundred four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •