Base | Representation |
---|---|
bin | 1010100010111001… |
… | …10010010100000000 |
3 | 112121120001100221110 |
4 | 11101130302110000 |
5 | 43043313433104 |
6 | 2333440523320 |
7 | 260203453221 |
oct | 52134622400 |
9 | 15546040843 |
10 | 5661467904 |
11 | 24458296a4 |
12 | 1120020540 |
13 | 6c2bc9611 |
14 | 3b9c89248 |
15 | 232066e89 |
hex | 151732500 |
5661467904 has 72 divisors (see below), whose sum is σ = 15155213472. Its totient is φ = 1876203520.
The previous prime is 5661467893. The next prime is 5661467909. The reversal of 5661467904 is 4097641665.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5661467909) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111559 + ... + 154169.
It is an arithmetic number, because the mean of its divisors is an integer number (210489076).
Almost surely, 25661467904 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 5661467904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7577606736).
5661467904 is an abundant number, since it is smaller than the sum of its proper divisors (9493745568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5661467904 is a wasteful number, since it uses less digits than its factorization.
5661467904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42803 (or 42789 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 48.
The square root of 5661467904 is about 75242.7265853650. The cubic root of 5661467904 is about 1782.2817080186.
The spelling of 5661467904 in words is "five billion, six hundred sixty-one million, four hundred sixty-seven thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •