Base | Representation |
---|---|
bin | 1010011101001011… |
… | …01100011011101100 |
3 | 112111012201220012200 |
4 | 11032211230123230 |
5 | 42444022041333 |
6 | 2325004101500 |
7 | 256051502013 |
oct | 51645543354 |
9 | 15435656180 |
10 | 5613471468 |
11 | 2420727220 |
12 | 1107b34890 |
13 | 6b5c93167 |
14 | 3b3753a7a |
15 | 22cc35c13 |
hex | 14e96c6ec |
5613471468 has 144 divisors (see below), whose sum is σ = 16700445216. Its totient is φ = 1570682880.
The previous prime is 5613471443. The next prime is 5613471481. The reversal of 5613471468 is 8641743165.
5613471468 is a `hidden beast` number, since 56 + 134 + 7 + 1 + 468 = 666.
It is a super-2 number, since 2×56134714682 = 63022123844100150048, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 348930 + ... + 364662.
It is an arithmetic number, because the mean of its divisors is an integer number (115975314).
Almost surely, 25613471468 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 5613471468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8350222608).
5613471468 is an abundant number, since it is smaller than the sum of its proper divisors (11086973748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5613471468 is a wasteful number, since it uses less digits than its factorization.
5613471468 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15824 (or 15819 counting only the distinct ones).
The product of its digits is 483840, while the sum is 45.
The square root of 5613471468 is about 74923.1036997267. The cubic root of 5613471468 is about 1777.2308358237.
The spelling of 5613471468 in words is "five billion, six hundred thirteen million, four hundred seventy-one thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •