Base | Representation |
---|---|
bin | 100110001000000101010… |
… | …1110110011000101000010 |
3 | 200112221110101222201200022 |
4 | 1030100022232303011002 |
5 | 1141323100234003442 |
6 | 15051124033453442 |
7 | 1050403036203353 |
oct | 114201256630502 |
9 | 20487411881608 |
10 | 5240040141122 |
11 | 174031a063386 |
12 | 70767aa11282 |
13 | 2c019787b827 |
14 | 1418954c3d2a |
15 | 9148ae5b3d2 |
hex | 4c40abb3142 |
5240040141122 has 8 divisors (see below), whose sum is σ = 7862221360956. Its totient is φ = 2619299687472.
The previous prime is 5240040141113. The next prime is 5240040141131. The reversal of 5240040141122 is 2211410400425.
It is an interprime number because it is at equal distance from previous prime (5240040141113) and next prime (5240040141131).
It can be written as a sum of positive squares in 2 ways, for example, as 5229275871121 + 10764270001 = 2286761^2 + 103751^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 5240040141091 and 5240040141100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 360182453 + ... + 360197000.
Almost surely, 25240040141122 is an apocalyptic number.
5240040141122 is a deficient number, since it is larger than the sum of its proper divisors (2622181219834).
5240040141122 is a wasteful number, since it uses less digits than its factorization.
5240040141122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 720383092.
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 5240040141122 its reverse (2211410400425), we get a palindrome (7451450541547).
The spelling of 5240040141122 in words is "five trillion, two hundred forty billion, forty million, one hundred forty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •