Base | Representation |
---|---|
bin | 11101101100001001000… |
… | …00011000101011000011 |
3 | 10121112010122012012201010 |
4 | 32312010200120223003 |
5 | 113203211331100311 |
6 | 2100350313212003 |
7 | 133462531513446 |
oct | 16660440305303 |
9 | 3545118165633 |
10 | 1020130331331 |
11 | 3636a8a82861 |
12 | 14585b701003 |
13 | 752759769b7 |
14 | 37535b7765d |
15 | 1b808b78da6 |
hex | ed84818ac3 |
1020130331331 has 16 divisors (see below), whose sum is σ = 1365368035968. Its totient is φ = 677491012800.
The previous prime is 1020130331329. The next prime is 1020130331447. The reversal of 1020130331331 is 1331330310201.
It is not a de Polignac number, because 1020130331331 - 21 = 1020130331329 is a prime.
It is a super-2 number, since 2×10201303313312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020130331298 and 1020130331307.
It is not an unprimeable number, because it can be changed into a prime (1020130331321) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 3138736 + ... + 3448466.
It is an arithmetic number, because the mean of its divisors is an integer number (85335502248).
Almost surely, 21020130331331 is an apocalyptic number.
1020130331331 is a deficient number, since it is larger than the sum of its proper divisors (345237704637).
1020130331331 is a wasteful number, since it uses less digits than its factorization.
1020130331331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313922.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 1020130331331 its reverse (1331330310201), we get a palindrome (2351460641532).
The spelling of 1020130331331 in words is "one trillion, twenty billion, one hundred thirty million, three hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •