Base | Representation |
---|---|
bin | 10010000010111100100… |
… | …001101111010100101010 |
3 | 11101112221122102012102120 |
4 | 102002330201233110222 |
5 | 130304223031324232 |
6 | 2345411133012110 |
7 | 155411112121245 |
oct | 22027441572452 |
9 | 4345848365376 |
10 | 1240113542442 |
11 | 438a24846265 |
12 | 180413624036 |
13 | 8cc33042b38 |
14 | 44043c1025c |
15 | 223d164e92c |
hex | 120bc86f52a |
1240113542442 has 8 divisors (see below), whose sum is σ = 2480227084896. Its totient is φ = 413371180812.
The previous prime is 1240113542419. The next prime is 1240113542513. The reversal of 1240113542442 is 2442453110421.
It is a sphenic number, since it is the product of 3 distinct primes.
1240113542442 is an admirable number.
It is a super-2 number, since 2×12401135424422 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 103342795198 + ... + 103342795209.
It is an arithmetic number, because the mean of its divisors is an integer number (310028385612).
Almost surely, 21240113542442 is an apocalyptic number.
1240113542442 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1240113542442 is a wasteful number, since it uses less digits than its factorization.
1240113542442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206685590412.
The product of its (nonzero) digits is 30720, while the sum is 33.
Adding to 1240113542442 its reverse (2442453110421), we get a palindrome (3682566652863).
The spelling of 1240113542442 in words is "one trillion, two hundred forty billion, one hundred thirteen million, five hundred forty-two thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •