Base | Representation |
---|---|
bin | 11100001011111110000111… |
… | …11110101101011111100100 |
3 | 22010110121102211010000212121 |
4 | 32011333003332231133210 |
5 | 31111021123011414324 |
6 | 335455012200555324 |
7 | 16025123223526600 |
oct | 1605770376553744 |
9 | 263417384100777 |
10 | 61983961044964 |
11 | 18828283100652 |
12 | 6b50aa7182b44 |
13 | 28780a726a60a |
14 | 114407add4500 |
15 | 7275299425e4 |
hex | 385fc3fad7e4 |
61983961044964 has 36 divisors (see below), whose sum is σ = 126473047709484. Its totient is φ = 26503204686336.
The previous prime is 61983961044953. The next prime is 61983961045147. The reversal of 61983961044964 is 46944016938916.
It can be written as a sum of positive squares in 2 ways, for example, as 9523346624064 + 52460614420900 = 3085992^2 + 7242970^2 .
It is a super-2 number, since 2×619839610449642 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 61983961044893 and 61983961044902.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 365093769 + ... + 365263504.
Almost surely, 261983961044964 is an apocalyptic number.
It is an amenable number.
61983961044964 is an abundant number, since it is smaller than the sum of its proper divisors (64489086664520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61983961044964 is a wasteful number, since it uses less digits than its factorization.
61983961044964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730357724 (or 730357715 counting only the distinct ones).
The product of its (nonzero) digits is 241864704, while the sum is 70.
The spelling of 61983961044964 in words is "sixty-one trillion, nine hundred eighty-three billion, nine hundred sixty-one million, forty-four thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •