Base | Representation |
---|---|
bin | 110011101000011110110… |
… | …1000100000000000000000 |
3 | 221010101211202000221122200 |
4 | 1213100331220200000000 |
5 | 1412231230410000000 |
6 | 23032000541233200 |
7 | 1331456265520560 |
oct | 147207550400000 |
9 | 27111752027580 |
10 | 7096320000000 |
11 | 2296594703a30 |
12 | 967393262800 |
13 | 3c62458c787a |
14 | 1a766c640da0 |
15 | c48d1823500 |
hex | 6743da20000 |
7096320000000 has 1728 divisors, whose sum is σ = 31948596336384. Its totient is φ = 1474560000000.
The previous prime is 7096319999981. The next prime is 7096320000031. The reversal of 7096320000000 is 236907.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 645119999995 + ... + 645120000005.
It is an arithmetic number, because the mean of its divisors is an integer number (18488771028).
Almost surely, 27096320000000 is an apocalyptic number.
7096320000000 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 7096320000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15974298168192).
7096320000000 is an abundant number, since it is smaller than the sum of its proper divisors (24852276336384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7096320000000 is an frugal number, since it uses more digits than its factorization.
7096320000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93 (or 28 counting only the distinct ones).
The product of its (nonzero) digits is 2268, while the sum is 27.
Adding to 7096320000000 its reverse (236907), we get a palindrome (7096320236907).
The spelling of 7096320000000 in words is "seven trillion, ninety-six billion, three hundred twenty million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •