Base | Representation |
---|---|
bin | 11101101100000110111… |
… | …10110001001000101110 |
3 | 10121112002102211021221220 |
4 | 32312003132301020232 |
5 | 113203142430130110 |
6 | 2100344500404210 |
7 | 133462232352051 |
oct | 16660336611056 |
9 | 3545072737856 |
10 | 1020113130030 |
11 | 36369a2a4205 |
12 | 1458559a6666 |
13 | 75272233407 |
14 | 3753377aa98 |
15 | 1b8073cc370 |
hex | ed837b122e |
1020113130030 has 64 divisors (see below), whose sum is σ = 2476562128128. Its totient is φ = 268902932480.
The previous prime is 1020113129993. The next prime is 1020113130031. The reversal of 1020113130030 is 300313110201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 1020113129991 and 1020113130009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020113130031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 505009 + ... + 1515011.
It is an arithmetic number, because the mean of its divisors is an integer number (38696283252).
Almost surely, 21020113130030 is an apocalyptic number.
1020113130030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1020113130030 is an abundant number, since it is smaller than the sum of its proper divisors (1456448998098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020113130030 is a wasteful number, since it uses less digits than its factorization.
1020113130030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010401.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1020113130030 its reverse (300313110201), we get a palindrome (1320426240231).
The spelling of 1020113130030 in words is "one trillion, twenty billion, one hundred thirteen million, one hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •