Base | Representation |
---|---|
bin | 111001101101010101… |
… | …001011011011000001 |
3 | 12220221100211201022100 |
4 | 321231111023123001 |
5 | 2003400213413442 |
6 | 44244335301013 |
7 | 4322343461511 |
oct | 715525133301 |
9 | 186840751270 |
10 | 61963810497 |
11 | 24307a56a46 |
12 | 1001367a769 |
13 | 5ac6573234 |
14 | 2ddb60b841 |
15 | 1929d6784c |
hex | e6d54b6c1 |
61963810497 has 48 divisors (see below), whose sum is σ = 93001214592. Its totient is φ = 39723540480.
The previous prime is 61963810471. The next prime is 61963810499. The reversal of 61963810497 is 79401836916.
61963810497 is a `hidden beast` number, since 6 + 19 + 63 + 81 + 0 + 497 = 666.
It is not a de Polignac number, because 61963810497 - 28 = 61963810241 is a prime.
It is a super-2 number, since 2×619638104972 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (61963810499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11208348 + ... + 11213874.
It is an arithmetic number, because the mean of its divisors is an integer number (1937525304).
Almost surely, 261963810497 is an apocalyptic number.
It is an amenable number.
61963810497 is a deficient number, since it is larger than the sum of its proper divisors (31037404095).
61963810497 is a wasteful number, since it uses less digits than its factorization.
61963810497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5958 (or 5955 counting only the distinct ones).
The product of its (nonzero) digits is 1959552, while the sum is 54.
The spelling of 61963810497 in words is "sixty-one billion, nine hundred sixty-three million, eight hundred ten thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •