Base | Representation |
---|---|
bin | 10110110010011010001101… |
… | …000010100000100110001100 |
3 | 111010212001021002022110100020 |
4 | 112302122031002200212030 |
5 | 101114010340040130444 |
6 | 553052541501102140 |
7 | 30052511051552436 |
oct | 2662321502404614 |
9 | 433761232273306 |
10 | 100221133130124 |
11 | 29a2a5a898a876 |
12 | b2a763a857950 |
13 | 43bca73820336 |
14 | 1aa6a2b89d656 |
15 | b8bead1dc119 |
hex | 5b268d0a098c |
100221133130124 has 48 divisors (see below), whose sum is σ = 237348858700800. Its totient is φ = 32909035476096.
The previous prime is 100221133130099. The next prime is 100221133130189. The reversal of 100221133130124 is 421031331122001.
It is a junction number, because it is equal to n+sod(n) for n = 100221133130094 and 100221133130103.
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 15 ways as a sum of consecutive naturals, for example, 119992137 + ... + 120824480.
It is an arithmetic number, because the mean of its divisors is an integer number (4944767889600).
Almost surely, 2100221133130124 is an apocalyptic number.
It is an amenable number.
100221133130124 is an abundant number, since it is smaller than the sum of its proper divisors (137127725570676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100221133130124 is a wasteful number, since it uses less digits than its factorization.
100221133130124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 240817142 (or 240817140 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 100221133130124 its reverse (421031331122001), we get a palindrome (521252464252125).
The spelling of 100221133130124 in words is "one hundred trillion, two hundred twenty-one billion, one hundred thirty-three million, one hundred thirty thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •