Base | Representation |
---|---|
bin | 11011110010111001111100… |
… | …10001010111111111101110 |
3 | 22000102021102202021221012110 |
4 | 31321130332101113333232 |
5 | 31002413314412102002 |
6 | 333555220353144450 |
7 | 15605654042332341 |
oct | 1571347621277756 |
9 | 260367382257173 |
10 | 61122724331502 |
11 | 18526002467759 |
12 | 6a31bb085b126 |
13 | 2814b04586962 |
14 | 11144d9c50458 |
15 | 70ee2055de6c |
hex | 37973e457fee |
61122724331502 has 8 divisors (see below), whose sum is σ = 122245448663016. Its totient is φ = 20374241443832.
The previous prime is 61122724331467. The next prime is 61122724331533. The reversal of 61122724331502 is 20513342722116.
It is a sphenic number, since it is the product of 3 distinct primes.
61122724331502 is an admirable number.
It is a super-2 number, since 2×611227243315022 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5093560360953 + ... + 5093560360964.
It is an arithmetic number, because the mean of its divisors is an integer number (15280681082877).
Almost surely, 261122724331502 is an apocalyptic number.
61122724331502 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.
61122724331502 is a wasteful number, since it uses less digits than its factorization.
61122724331502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10187120721922.
The product of its (nonzero) digits is 120960, while the sum is 39.
The spelling of 61122724331502 in words is "sixty-one trillion, one hundred twenty-two billion, seven hundred twenty-four million, three hundred thirty-one thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •