Base | Representation |
---|---|
bin | 11011111100010000011011… |
… | …01100111000001111111000 |
3 | 22001112222210020100221011020 |
4 | 31332020031230320033320 |
5 | 31023144334143130422 |
6 | 334402555411502440 |
7 | 15641120251442301 |
oct | 1576101554701770 |
9 | 261488706327136 |
10 | 61444032005112 |
11 | 1863a2a4251569 |
12 | 6a84321bb7a20 |
13 | 28391bb983b53 |
14 | 1125c9abd57a8 |
15 | 71847869295c |
hex | 37e20db383f8 |
61444032005112 has 64 divisors (see below), whose sum is σ = 161938972569600. Its totient is φ = 19398939400320.
The previous prime is 61444032004997. The next prime is 61444032005113. The reversal of 61444032005112 is 21150023044416.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61444032005113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 878540187 + ... + 878610122.
It is an arithmetic number, because the mean of its divisors is an integer number (2530296446400).
Almost surely, 261444032005112 is an apocalyptic number.
61444032005112 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is an amenable number.
61444032005112 is an abundant number, since it is smaller than the sum of its proper divisors (100494940564488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61444032005112 is a wasteful number, since it uses less digits than its factorization.
61444032005112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1757150396 (or 1757150392 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 61444032005112 its reverse (21150023044416), we get a palindrome (82594055049528).
The spelling of 61444032005112 in words is "sixty-one trillion, four hundred forty-four billion, thirty-two million, five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •