Base | Representation |
---|---|
bin | 11111001011100101001… |
… | …10001111100111010000 |
3 | 10210102101120200220021010 |
4 | 33211302212033213100 |
5 | 120023131042003002 |
6 | 2140102542130520 |
7 | 140255351235420 |
oct | 17456246174720 |
9 | 3712346626233 |
10 | 1071369484752 |
11 | 383402164146 |
12 | 15377b580a40 |
13 | 7a0503692a8 |
14 | 39bd6caa480 |
15 | 1cd071e046c |
hex | f97298f9d0 |
1071369484752 has 40 divisors (see below), whose sum is σ = 3163090860736. Its totient is φ = 306105566976.
The previous prime is 1071369484733. The next prime is 1071369484813. The reversal of 1071369484752 is 2574849631701.
It is a super-2 number, since 2×10713694847522 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1071369484692 and 1071369484701.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1594299493 + ... + 1594300164.
It is a 2-persistent number, because it is pandigital, and so is 2⋅1071369484752 = 2142738969504, but 3⋅1071369484752 = 3214108454256 is not.
Almost surely, 21071369484752 is an apocalyptic number.
1071369484752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1071369484752 is an abundant number, since it is smaller than the sum of its proper divisors (2091721375984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1071369484752 is a wasteful number, since it uses less digits than its factorization.
1071369484752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3188599675 (or 3188599669 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 57.
The spelling of 1071369484752 in words is "one trillion, seventy-one billion, three hundred sixty-nine million, four hundred eighty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •