Base | Representation |
---|---|
bin | 11011111100001100110110… |
… | …11000011000101101101010 |
3 | 22001112210211120100201112100 |
4 | 31332012123120120231222 |
5 | 31023131422142433232 |
6 | 334402041214554230 |
7 | 15641021602100355 |
oct | 1576063330305552 |
9 | 261483746321470 |
10 | 61442114030442 |
11 | 186394aa639832 |
12 | 6a83a87808976 |
13 | 2838c744c89b2 |
14 | 1125b581ad29c |
15 | 7183b50d3c7c |
hex | 37e19b618b6a |
61442114030442 has 48 divisors (see below), whose sum is σ = 133682183256960. Its totient is φ = 20395047386400.
The previous prime is 61442114030441. The next prime is 61442114030449. The reversal of 61442114030442 is 24403041124416.
61442114030442 is a `hidden beast` number, since 6 + 1 + 4 + 42 + 1 + 140 + 30 + 442 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 61442114030397 and 61442114030406.
It is not an unprimeable number, because it can be changed into a prime (61442114030441) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 448684 + ... + 11094392.
It is an arithmetic number, because the mean of its divisors is an integer number (2785045484520).
Almost surely, 261442114030442 is an apocalyptic number.
61442114030442 is an abundant number, since it is smaller than the sum of its proper divisors (72240069226518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61442114030442 is a wasteful number, since it uses less digits than its factorization.
61442114030442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10647059 (or 10647056 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 36.
Adding to 61442114030442 its reverse (24403041124416), we get a palindrome (85845155154858).
The spelling of 61442114030442 in words is "sixty-one trillion, four hundred forty-two billion, one hundred fourteen million, thirty thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •