Base | Representation |
---|---|
bin | 10110111111100001011010… |
… | …001000100110101011000100 |
3 | 111021001012010112102010210110 |
4 | 112333201122020212223010 |
5 | 101223241302342101040 |
6 | 555022524011353020 |
7 | 30204560635505136 |
oct | 2677413210465304 |
9 | 437035115363713 |
10 | 101122222222020 |
11 | 2a24776a21450a |
12 | b4121b7752770 |
13 | 4456a27b0b0cc |
14 | 1ad84ad785056 |
15 | ba564b147980 |
hex | 5bf85a226ac4 |
101122222222020 has 48 divisors (see below), whose sum is σ = 299797647061248. Its totient is φ = 25379694988800.
The previous prime is 101122222222019. The next prime is 101122222222033. The reversal of 101122222222020 is 20222222221101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49569715756 + ... + 49569717795.
It is an arithmetic number, because the mean of its divisors is an integer number (6245784313776).
Almost surely, 2101122222222020 is an apocalyptic number.
101122222222020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101122222222020 is an abundant number, since it is smaller than the sum of its proper divisors (198675424839228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101122222222020 is a wasteful number, since it uses less digits than its factorization.
101122222222020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99139433580 (or 99139433578 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 101122222222020 its reverse (20222222221101), we get a palindrome (121344444443121).
The spelling of 101122222222020 in words is "one hundred one trillion, one hundred twenty-two billion, two hundred twenty-two million, two hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •