Base | Representation |
---|---|
bin | 1010011011110011… |
… | …10010011100100100 |
3 | 112110102002010212100 |
4 | 11031321302130210 |
5 | 42433100234024 |
6 | 2323513252100 |
7 | 255551614020 |
oct | 51571623444 |
9 | 15412063770 |
10 | 5601961764 |
11 | 2415185873 |
12 | 1104104030 |
13 | 6b3793399 |
14 | 3b1dd9380 |
15 | 22bc107c9 |
hex | 14de72724 |
5601961764 has 144 divisors (see below), whose sum is σ = 17157876736. Its totient is φ = 1506988800.
The previous prime is 5601961763. The next prime is 5601961793. The reversal of 5601961764 is 4671691065.
5601961764 is a `hidden beast` number, since 560 + 19 + 6 + 1 + 76 + 4 = 666.
It is not an unprimeable number, because it can be changed into a prime (5601961763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 279354 + ... + 298734.
Almost surely, 25601961764 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5601961764, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8578938368).
5601961764 is an abundant number, since it is smaller than the sum of its proper divisors (11555914972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5601961764 is a wasteful number, since it uses less digits than its factorization.
5601961764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19466 (or 19461 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 5601961764 is about 74846.2541748082. The cubic root of 5601961764 is about 1776.0153433359.
The spelling of 5601961764 in words is "five billion, six hundred one million, nine hundred sixty-one thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •