Base | Representation |
---|---|
bin | 1101010100001001… |
… | …10001000111111100 |
3 | 200110011212111020020 |
4 | 12222010301013330 |
5 | 104114434000204 |
6 | 3141153452140 |
7 | 342066630330 |
oct | 65204610774 |
9 | 20404774206 |
10 | 7148343804 |
11 | 3039065558 |
12 | 1475b71050 |
13 | 89bc75044 |
14 | 4bb5337c0 |
15 | 2bc86cbd9 |
hex | 1aa1311fc |
7148343804 has 192 divisors, whose sum is σ = 20698675200. Its totient is φ = 1873797120.
The previous prime is 7148343803. The next prime is 7148343817. The reversal of 7148343804 is 4083438417.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7148343803) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11933497 + ... + 11934095.
It is an arithmetic number, because the mean of its divisors is an integer number (107805600).
Almost surely, 27148343804 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 7148343804, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10349337600).
7148343804 is an abundant number, since it is smaller than the sum of its proper divisors (13550331396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7148343804 is a wasteful number, since it uses less digits than its factorization.
7148343804 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 828 (or 826 counting only the distinct ones).
The product of its (nonzero) digits is 258048, while the sum is 42.
The square root of 7148343804 is about 84547.8787670040. The cubic root of 7148343804 is about 1926.3497637858.
The spelling of 7148343804 in words is "seven billion, one hundred forty-eight million, three hundred forty-three thousand, eight hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •