Base | Representation |
---|---|
bin | 1010011101001011… |
… | …01000111000100111 |
3 | 112111012201011021102 |
4 | 11032211220320213 |
5 | 42444021110220 |
6 | 2325003510315 |
7 | 256051411442 |
oct | 51645507047 |
9 | 15435634242 |
10 | 5613456935 |
11 | 2420717309 |
12 | 1107b2839b |
13 | 6b5c89668 |
14 | 3b374c659 |
15 | 22cc31775 |
hex | 14e968e27 |
5613456935 has 16 divisors (see below), whose sum is σ = 7038719424. Its totient is φ = 4289590272.
The previous prime is 5613456931. The next prime is 5613456991. The reversal of 5613456935 is 5396543165.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 5613456935 - 22 = 5613456931 is a prime.
It is a super-2 number, since 2×56134569352 = 63021797522199188450, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5613456935.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5613456931) 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 15 ways as a sum of consecutive naturals, for example, 50999 + ... + 117591.
It is an arithmetic number, because the mean of its divisors is an integer number (439919964).
Almost surely, 25613456935 is an apocalyptic number.
5613456935 is a deficient number, since it is larger than the sum of its proper divisors (1425262489).
5613456935 is a wasteful number, since it uses less digits than its factorization.
5613456935 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67354.
The product of its digits is 1458000, while the sum is 47.
The square root of 5613456935 is about 74923.0067135590. The cubic root of 5613456935 is about 1777.2293021015.
The spelling of 5613456935 in words is "five billion, six hundred thirteen million, four hundred fifty-six thousand, nine hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •