Base | Representation |
---|---|
bin | 1101000111100011… |
… | …10100110100010000 |
3 | 200011211002222121110 |
4 | 12203301310310100 |
5 | 103410413334041 |
6 | 3122501453320 |
7 | 336345042330 |
oct | 64361646420 |
9 | 20154088543 |
10 | 7042714896 |
11 | 2a94479a38 |
12 | 1446711240 |
13 | 883110429 |
14 | 4ab4b90c0 |
15 | 2b3455516 |
hex | 1a3c74d10 |
7042714896 has 160 divisors (see below), whose sum is σ = 21114585088. Its totient is φ = 1981324800.
The previous prime is 7042714883. The next prime is 7042714897. The reversal of 7042714896 is 6984172407.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (7042714897) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6442926 + ... + 6444018.
Almost surely, 27042714896 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 7042714896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10557292544).
7042714896 is an abundant number, since it is smaller than the sum of its proper divisors (14071870192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7042714896 is a wasteful number, since it uses less digits than its factorization.
7042714896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1389 (or 1383 counting only the distinct ones).
The product of its (nonzero) digits is 677376, while the sum is 48.
The square root of 7042714896 is about 83920.8847427147. The cubic root of 7042714896 is about 1916.8142787116.
The spelling of 7042714896 in words is "seven billion, forty-two million, seven hundred fourteen thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •