Base | Representation |
---|---|
bin | 10110111111010110000010… |
… | …111100100001111110011100 |
3 | 111021000000122021120201022011 |
4 | 112333112002330201332130 |
5 | 101223041311114133040 |
6 | 555013145231001004 |
7 | 30203646413506045 |
oct | 2677260274417634 |
9 | 437000567521264 |
10 | 101110022021020 |
11 | 2a242579552971 |
12 | b40b971969164 |
13 | 445583234b96c |
14 | 1ad7a733318cc |
15 | ba518502d3ea |
hex | 5bf582f21f9c |
101110022021020 has 12 divisors (see below), whose sum is σ = 212331046244184. Its totient is φ = 40444008808400.
The previous prime is 101110022020957. The next prime is 101110022021069. The reversal of 101110022021020 is 20120220011101.
It is a super-2 number, since 2×1011100220210202 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2527750550506 + ... + 2527750550545.
It is an arithmetic number, because the mean of its divisors is an integer number (17694253853682).
Almost surely, 2101110022021020 is an apocalyptic number.
101110022021020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101110022021020 is an abundant number, since it is smaller than the sum of its proper divisors (111221024223164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101110022021020 is a wasteful number, since it uses less digits than its factorization.
101110022021020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5055501101060 (or 5055501101058 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101110022021020 its reverse (20120220011101), we get a palindrome (121230242032121).
The spelling of 101110022021020 in words is "one hundred one trillion, one hundred ten billion, twenty-two million, twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •