Base | Representation |
---|---|
bin | 11101101110010100110… |
… | …11101010111000100000 |
3 | 10121122011101201101000102 |
4 | 32313022123222320200 |
5 | 113213112144002240 |
6 | 2101102542241532 |
7 | 133533565342265 |
oct | 16671233527040 |
9 | 3548141641012 |
10 | 1021303500320 |
11 | 364150223004 |
12 | 145b285862a8 |
13 | 75401a3572c |
14 | 376078c126c |
15 | 1b876b64815 |
hex | edca6eae20 |
1021303500320 has 48 divisors (see below), whose sum is σ = 2496030548760. Its totient is φ = 394434453504.
The previous prime is 1021303500319. The next prime is 1021303500337. The reversal of 1021303500320 is 230053031201.
It can be written as a sum of positive squares in 4 ways, for example, as 715357340944 + 305946159376 = 845788^2 + 553124^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1021303500292 and 1021303500301.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110049617 + ... + 110058896.
Almost surely, 21021303500320 is an apocalyptic number.
1021303500320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021303500320 is an abundant number, since it is smaller than the sum of its proper divisors (1474727048440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021303500320 is a wasteful number, since it uses less digits than its factorization.
1021303500320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220108557 (or 220108549 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 1021303500320 its reverse (230053031201), we get a palindrome (1251356531521).
The spelling of 1021303500320 in words is "one trillion, twenty-one billion, three hundred three million, five hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •