Base | Representation |
---|---|
bin | 11111010010011001000… |
… | …10110110011001110100 |
3 | 10210202211102010112211022 |
4 | 33221030202312121310 |
5 | 120103123130400043 |
6 | 2141505442400312 |
7 | 140445101316662 |
oct | 17511442663164 |
9 | 3722742115738 |
10 | 1075026028148 |
11 | 384a09192336 |
12 | 154420060098 |
13 | 7a4b3a85c37 |
14 | 3a062777c32 |
15 | 1ce6d220868 |
hex | fa4c8b6674 |
1075026028148 has 12 divisors (see below), whose sum is σ = 1927180806852. Its totient is φ = 524402940480.
The previous prime is 1075026028147. The next prime is 1075026028259. The reversal of 1075026028148 is 8418206205701.
It can be written as a sum of positive squares in 2 ways, for example, as 83412371344 + 991613656804 = 288812^2 + 995798^2 .
It is a super-3 number, since 3×10750260281483 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1075026028099 and 1075026028108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1075026028147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3277518215 + ... + 3277518542.
It is an arithmetic number, because the mean of its divisors is an integer number (160598400571).
Almost surely, 21075026028148 is an apocalyptic number.
It is an amenable number.
1075026028148 is a deficient number, since it is larger than the sum of its proper divisors (852154778704).
1075026028148 is a wasteful number, since it uses less digits than its factorization.
1075026028148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6555036802 (or 6555036800 counting only the distinct ones).
The product of its (nonzero) digits is 215040, while the sum is 44.
The spelling of 1075026028148 in words is "one trillion, seventy-five billion, twenty-six million, twenty-eight thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •