Base | Representation |
---|---|
bin | 110011110000101001010… |
… | …0011000000000000000000 |
3 | 221012002002111020021020000 |
4 | 1213201102203000000000 |
5 | 1413023131242431203 |
6 | 23044020302120000 |
7 | 1332646565444010 |
oct | 147412243000000 |
9 | 27162074207200 |
10 | 7113850748928 |
11 | 22a2a70321090 |
12 | 96a866280000 |
13 | 3c7aaa84aba1 |
14 | 1a84529dbc40 |
15 | c50aa8d94a3 |
hex | 678528c0000 |
7113850748928 has 1520 divisors, whose sum is σ = 28014541843200. Its totient is φ = 1742859141120.
The previous prime is 7113850748911. The next prime is 7113850748929. The reversal of 7113850748928 is 8298470583117.
7113850748928 is a `hidden beast` number, since 7 + 1 + 1 + 38 + 507 + 4 + 8 + 92 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is not an unprimeable number, because it can be changed into a prime (7113850748929) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 31064850318 + ... + 31064850546.
Almost surely, 27113850748928 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 7113850748928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14007270921600).
7113850748928 is an abundant number, since it is smaller than the sum of its proper divisors (20900691094272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7113850748928 is an equidigital number, since it uses as much as digits as its factorization.
7113850748928 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 314 (or 271 counting only the distinct ones).
The product of its (nonzero) digits is 27095040, while the sum is 63.
The spelling of 7113850748928 in words is "seven trillion, one hundred thirteen billion, eight hundred fifty million, seven hundred forty-eight thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •