Base | Representation |
---|---|
bin | 11101101100011111000… |
… | …01011000011111110100 |
3 | 10121112121111221120110121 |
4 | 32312033201120133310 |
5 | 113204101134022012 |
6 | 2100420514301324 |
7 | 133500234416446 |
oct | 16661741303764 |
9 | 3545544846417 |
10 | 1020315142132 |
11 | 363793330960 |
12 | 1458b1587844 |
13 | 752a50434c0 |
14 | 37552524496 |
15 | 1b819ed2a07 |
hex | ed8f8587f4 |
1020315142132 has 96 divisors (see below), whose sum is σ = 2106115522560. Its totient is φ = 426392311680.
The previous prime is 1020315142051. The next prime is 1020315142163. The reversal of 1020315142132 is 2312415130201.
It is a junction number, because it is equal to n+sod(n) for n = 1020315142097 and 1020315142106.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 180296719 + ... + 180302377.
It is an arithmetic number, because the mean of its divisors is an integer number (21938703360).
Almost surely, 21020315142132 is an apocalyptic number.
It is an amenable number.
1020315142132 is an abundant number, since it is smaller than the sum of its proper divisors (1085800380428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020315142132 is a wasteful number, since it uses less digits than its factorization.
1020315142132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6893 (or 6891 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 25.
The spelling of 1020315142132 in words is "one trillion, twenty billion, three hundred fifteen million, one hundred forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •