Base | Representation |
---|---|
bin | 11101101100000101110… |
… | …00111110000001000001 |
3 | 10121112001202011212202101 |
4 | 32312002320332001001 |
5 | 113203132411040223 |
6 | 2100343504150401 |
7 | 133462052212501 |
oct | 16660270760101 |
9 | 3545052155671 |
10 | 1020103221313 |
11 | 363694746690 |
12 | 145852608401 |
13 | 75270174277 |
14 | 3753231ba01 |
15 | 1b8065c14ad |
hex | ed82e3e041 |
1020103221313 has 16 divisors (see below), whose sum is σ = 1191264825600. Its totient is φ = 863666977680.
The previous prime is 1020103221281. The next prime is 1020103221329. The reversal of 1020103221313 is 3131223010201.
It is not a de Polignac number, because 1020103221313 - 25 = 1020103221281 is a prime.
It is a super-3 number, since 3×10201032213133 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1020103221353) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41351031 + ... + 41375692.
It is an arithmetic number, because the mean of its divisors is an integer number (74454051600).
Almost surely, 21020103221313 is an apocalyptic number.
It is an amenable number.
1020103221313 is a deficient number, since it is larger than the sum of its proper divisors (171161604287).
1020103221313 is a wasteful number, since it uses less digits than its factorization.
1020103221313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82726812.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1020103221313 its reverse (3131223010201), we get a palindrome (4151326231514).
The spelling of 1020103221313 in words is "one trillion, twenty billion, one hundred three million, two hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •