Base | Representation |
---|---|
bin | 10110111111100000010001… |
… | …011010001101110011101000 |
3 | 111021001001222111112121202210 |
4 | 112333200101122031303220 |
5 | 101223231303014230432 |
6 | 555022202544125120 |
7 | 30204515461610655 |
oct | 2677402132156350 |
9 | 437031874477683 |
10 | 101121002101992 |
11 | 2a2471a3516254 |
12 | b411b170067a0 |
13 | 44568920c09b2 |
14 | 1ad83d56d8c2c |
15 | ba55c8e858cc |
hex | 5bf81168dce8 |
101121002101992 has 64 divisors (see below), whose sum is σ = 266110180416000. Its totient is φ = 31932674414784.
The previous prime is 101121002101937. The next prime is 101121002102017. The reversal of 101121002101992 is 299101200121101.
101121002101992 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1011210021019922 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56075463 + ... + 57850665.
It is an arithmetic number, because the mean of its divisors is an integer number (4157971569000).
Almost surely, 2101121002101992 is an apocalyptic number.
101121002101992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101121002101992 is an abundant number, since it is smaller than the sum of its proper divisors (164989178314008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101121002101992 is a wasteful number, since it uses less digits than its factorization.
101121002101992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1900150 (or 1900146 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 30.
The spelling of 101121002101992 in words is "one hundred one trillion, one hundred twenty-one billion, two million, one hundred one thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •