Base | Representation |
---|---|
bin | 1101100111000001… |
… | …10111111000001010 |
3 | 200212012212010221010 |
4 | 12303200313320022 |
5 | 104431004101232 |
6 | 3205012024350 |
7 | 346031660100 |
oct | 66340677012 |
9 | 20765763833 |
10 | 7306706442 |
11 | 310a499772 |
12 | 14bb0020b6 |
13 | 8c5a11449 |
14 | 4d4597c70 |
15 | 2cb7000cc |
hex | 1b3837e0a |
7306706442 has 48 divisors (see below), whose sum is σ = 17037952992. Its totient is φ = 2082880800.
The previous prime is 7306706377. The next prime is 7306706467. The reversal of 7306706442 is 2446076037.
It is a self number, because there is not a number n which added to its sum of digits gives 7306706442.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 102192 + ... + 158292.
It is an arithmetic number, because the mean of its divisors is an integer number (354957354).
Almost surely, 27306706442 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 7306706442, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8518976496).
7306706442 is an abundant number, since it is smaller than the sum of its proper divisors (9731246550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7306706442 is a wasteful number, since it uses less digits than its factorization.
7306706442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56563 (or 56556 counting only the distinct ones).
The product of its (nonzero) digits is 169344, while the sum is 39.
The square root of 7306706442 is about 85479.2749267330. The cubic root of 7306706442 is about 1940.4712818609.
The spelling of 7306706442 in words is "seven billion, three hundred six million, seven hundred six thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •