Base | Representation |
---|---|
bin | 110100000001011110110… |
… | …1000101100110010111000 |
3 | 221022112102021212102102220 |
4 | 1220002331220230302320 |
5 | 1414121203312043413 |
6 | 23112400135124040 |
7 | 1335366561643260 |
oct | 150027550546270 |
9 | 27275367772386 |
10 | 7150007143608 |
11 | 23073346a55aa |
12 | 975876b13620 |
13 | 3cb320509474 |
14 | 1aa0c29267a0 |
15 | c5ec4c40223 |
hex | 680bda2ccb8 |
7150007143608 has 128 divisors (see below), whose sum is σ = 20455986654720. Its totient is φ = 2040121405440.
The previous prime is 7150007143603. The next prime is 7150007143651. The reversal of 7150007143608 is 8063417000517.
It is a super-2 number, since 2×71500071436082 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 7150007143608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7150007143603) 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, 516574768 + ... + 516588608.
It is an arithmetic number, because the mean of its divisors is an integer number (159812395740).
Almost surely, 27150007143608 is an apocalyptic number.
It is an amenable number.
7150007143608 is an abundant number, since it is smaller than the sum of its proper divisors (13305979511112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7150007143608 is a wasteful number, since it uses less digits than its factorization.
7150007143608 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17757 (or 17753 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 42.
The spelling of 7150007143608 in words is "seven trillion, one hundred fifty billion, seven million, one hundred forty-three thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •