Base | Representation |
---|---|
bin | 11110110110100111010… |
… | …10111011101101100000 |
3 | 10202100100010000111012112 |
4 | 33123103222323231200 |
5 | 114332102434431031 |
6 | 2131002001014452 |
7 | 136406410352531 |
oct | 17332352735540 |
9 | 3670303014175 |
10 | 1060113202016 |
11 | 3796562a1340 |
12 | 151559924428 |
13 | 78c7830c66b |
14 | 39449d66688 |
15 | 1c898dca62b |
hex | f6d3abbb60 |
1060113202016 has 48 divisors (see below), whose sum is σ = 2277026313408. Its totient is φ = 481828944000.
The previous prime is 1060113201943. The next prime is 1060113202039. The reversal of 1060113202016 is 6102023110601.
It is a super-2 number, since 2×10601132020162 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1060113201982 and 1060113202000.
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, 4261811 + ... + 4503693.
It is an arithmetic number, because the mean of its divisors is an integer number (47438048196).
Almost surely, 21060113202016 is an apocalyptic number.
1060113202016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1060113202016 is an abundant number, since it is smaller than the sum of its proper divisors (1216913111392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1060113202016 is a wasteful number, since it uses less digits than its factorization.
1060113202016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254355 (or 254347 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 1060113202016 its reverse (6102023110601), we get a palindrome (7162136312617).
The spelling of 1060113202016 in words is "one trillion, sixty billion, one hundred thirteen million, two hundred two thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •