Base | Representation |
---|---|
bin | 111001011000100110… |
… | …011110011101000101 |
3 | 12220001010102022001110 |
4 | 321120212132131011 |
5 | 2002142200221430 |
6 | 44150033115233 |
7 | 4310621362041 |
oct | 713046363505 |
9 | 186033368043 |
10 | 61616023365 |
11 | 24149703366 |
12 | bb370b8b19 |
13 | 5a6c4b3330 |
14 | 2da7359021 |
15 | 19095697b0 |
hex | e5899e745 |
61616023365 has 64 divisors (see below), whose sum is σ = 107788423680. Its totient is φ = 29872389120.
The previous prime is 61616023321. The next prime is 61616023379. The reversal of 61616023365 is 56332061616.
It is a happy number.
It is not a de Polignac number, because 61616023365 - 28 = 61616023109 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 15352099 + ... + 15356111.
It is an arithmetic number, because the mean of its divisors is an integer number (1684194120).
Almost surely, 261616023365 is an apocalyptic number.
61616023365 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
61616023365 is a deficient number, since it is larger than the sum of its proper divisors (46172400315).
61616023365 is a wasteful number, since it uses less digits than its factorization.
61616023365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5214.
The product of its (nonzero) digits is 116640, while the sum is 39.
The spelling of 61616023365 in words is "sixty-one billion, six hundred sixteen million, twenty-three thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •