Base | Representation |
---|---|
bin | 11011110000111100110010… |
… | …10110100110001110010000 |
3 | 22000011212000001212010011121 |
4 | 31320132121112212032100 |
5 | 31000313212413403131 |
6 | 333504305152452024 |
7 | 15601055011116124 |
oct | 1570363126461620 |
9 | 260155001763147 |
10 | 61055532950416 |
11 | 184aa5626aa644 |
12 | 6a20b7a54a014 |
13 | 280b686c965b4 |
14 | 1111164263584 |
15 | 70d2db7db911 |
hex | 3787995a6390 |
61055532950416 has 15 divisors (see below), whose sum is σ = 118295155648443. Its totient is φ = 30527750847600.
The previous prime is 61055532950413. The next prime is 61055532950417. The reversal of 61055532950416 is 61405923555016.
The square root of 61055532950416 is 7813804.
It is a perfect power (a square), and thus also a powerful number.
61055532950416 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61055532950413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 30278491 + ... + 32231941.
Almost surely, 261055532950416 is an apocalyptic number.
61055532950416 is the 7813804-th square number.
It is an amenable number.
61055532950416 is a deficient number, since it is larger than the sum of its proper divisors (57239622698027).
61055532950416 is an frugal number, since it uses more digits than its factorization.
61055532950416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3906910 (or 1953453 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 52.
The spelling of 61055532950416 in words is "sixty-one trillion, fifty-five billion, five hundred thirty-two million, nine hundred fifty thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •