Base | Representation |
---|---|
bin | 11101011001101011101… |
… | …11101111110111111100 |
3 | 10120120120001021011121211 |
4 | 32230311313233313330 |
5 | 113022413101333040 |
6 | 2052031132334204 |
7 | 132662135563456 |
oct | 16546567576774 |
9 | 3516501234554 |
10 | 1010221121020 |
11 | 35a483539451 |
12 | 143955014364 |
13 | 74356a26a47 |
14 | 36c75ac92d6 |
15 | 1b428c518ea |
hex | eb35defdfc |
1010221121020 has 24 divisors (see below), whose sum is σ = 2128960706544. Its totient is φ = 402660571776.
The previous prime is 1010221121009. The next prime is 1010221121023. The reversal of 1010221121020 is 201211220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010221121023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89236489 + ... + 89247808.
It is an arithmetic number, because the mean of its divisors is an integer number (88706696106).
Almost surely, 21010221121020 is an apocalyptic number.
1010221121020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010221121020 is an abundant number, since it is smaller than the sum of its proper divisors (1118739585524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010221121020 is a wasteful number, since it uses less digits than its factorization.
1010221121020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178484589 (or 178484587 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1010221121020 its reverse (201211220101), we get a palindrome (1211432341121).
The spelling of 1010221121020 in words is "one trillion, ten billion, two hundred twenty-one million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •