Base | Representation |
---|---|
bin | 11101101100000101011… |
… | …01100001100100010101 |
3 | 10121112001112112110101021 |
4 | 32312002231201210111 |
5 | 113203131124034310 |
6 | 2100343320001141 |
7 | 133462014546022 |
oct | 16660255414425 |
9 | 3545045473337 |
10 | 1020100221205 |
11 | 363692a8765a |
12 | 1458516001b1 |
13 | 7526c663860 |
14 | 37531b7a549 |
15 | 1b8061cc5da |
hex | ed82b61915 |
1020100221205 has 64 divisors (see below), whose sum is σ = 1423374482880. Its totient is φ = 695024418816.
The previous prime is 1020100221199. The next prime is 1020100221233. The reversal of 1020100221205 is 5021220010201.
It is a happy number.
It can be written as a sum of positive squares in 32 ways, for example, as 332622106756 + 687478114449 = 576734^2 + 829143^2 .
It is not a de Polignac number, because 1020100221205 - 23 = 1020100221197 is a prime.
It is a super-2 number, since 2×10201002212052 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 75483529 + ... + 75497041.
It is an arithmetic number, because the mean of its divisors is an integer number (22240226295).
Almost surely, 21020100221205 is an apocalyptic number.
It is an amenable number.
1020100221205 is a deficient number, since it is larger than the sum of its proper divisors (403274261675).
1020100221205 is a wasteful number, since it uses less digits than its factorization.
1020100221205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14890.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 1020100221205 its reverse (5021220010201), we get a palindrome (6041320231406).
The spelling of 1020100221205 in words is "one trillion, twenty billion, one hundred million, two hundred twenty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.246 sec. • engine limits •