Base | Representation |
---|---|
bin | 11101101100001001000… |
… | …11111010010000101100 |
3 | 10121112010200221011012200 |
4 | 32312010203322100230 |
5 | 113203212100132330 |
6 | 2100350345101500 |
7 | 133462542412401 |
oct | 16660443722054 |
9 | 3545120834180 |
10 | 1020131255340 |
11 | 3636a9553aaa |
12 | 14585ba87890 |
13 | 75275c0b452 |
14 | 37535d382a8 |
15 | 1b808caca60 |
hex | ed848fa42c |
1020131255340 has 72 divisors (see below), whose sum is σ = 3146845600080. Its totient is φ = 267424235904.
The previous prime is 1020131255327. The next prime is 1020131255417. The reversal of 1020131255340 is 435521310201.
1020131255340 is a `hidden beast` number, since 1 + 0 + 2 + 0 + 1 + 3 + 125 + 534 + 0 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48018159 + ... + 48039398.
It is an arithmetic number, because the mean of its divisors is an integer number (43706188890).
Almost surely, 21020131255340 is an apocalyptic number.
1020131255340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020131255340 is an abundant number, since it is smaller than the sum of its proper divisors (2126714344740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020131255340 is a wasteful number, since it uses less digits than its factorization.
1020131255340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96057631 (or 96057626 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 1020131255340 its reverse (435521310201), we get a palindrome (1455652565541).
The spelling of 1020131255340 in words is "one trillion, twenty billion, one hundred thirty-one million, two hundred fifty-five thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •