Base | Representation |
---|---|
bin | 11101101100001001001… |
… | …00001000010101011001 |
3 | 10121112010201001002021200 |
4 | 32312010210020111121 |
5 | 113203212104003420 |
6 | 2100350350224413 |
7 | 133462543042431 |
oct | 16660444102531 |
9 | 3545121032250 |
10 | 1020131312985 |
11 | 3636a9593344 |
12 | 14585bab5109 |
13 | 75275c2b765 |
14 | 37535d512c1 |
15 | 1b808cbeb90 |
hex | ed84908559 |
1020131312985 has 24 divisors (see below), whose sum is σ = 1768727525760. Its totient is φ = 543916213152.
The previous prime is 1020131312957. The next prime is 1020131312999. The reversal of 1020131312985 is 5892131310201.
1020131312985 is a `hidden beast` number, since 10 + 201 + 313 + 129 + 8 + 5 = 666.
It is not a de Polignac number, because 1020131312985 - 25 = 1020131312953 is a prime.
It is a super-2 number, since 2×10201313129852 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3043569 + ... + 3362078.
It is an arithmetic number, because the mean of its divisors is an integer number (73696980240).
Almost surely, 21020131312985 is an apocalyptic number.
1020131312985 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1020131312985 is a deficient number, since it is larger than the sum of its proper divisors (748596212775).
1020131312985 is a wasteful number, since it uses less digits than its factorization.
1020131312985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6409197 (or 6409194 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 36.
The spelling of 1020131312985 in words is "one trillion, twenty billion, one hundred thirty-one million, three hundred twelve thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •