Base | Representation |
---|---|
bin | 10110111111100000010001… |
… | …011010101000011100110001 |
3 | 111021001001222111202011110121 |
4 | 112333200101122220130301 |
5 | 101223231303031223441 |
6 | 555022202550330241 |
7 | 30204515462544064 |
oct | 2677402132503461 |
9 | 437031874664417 |
10 | 101121002211121 |
11 | 2a2471a3590242 |
12 | b411b17059981 |
13 | 445689212b579 |
14 | 1ad83d57268db |
15 | ba55c8ea7dd1 |
hex | 5bf8116a8731 |
101121002211121 has 32 divisors (see below), whose sum is σ = 114108620866560. Its totient is φ = 89092371895296.
The previous prime is 101121002211043. The next prime is 101121002211127. The reversal of 101121002211121 is 121112200121101.
It is not a de Polignac number, because 101121002211121 - 29 = 101121002210609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101121002211095 and 101121002211104.
It is not an unprimeable number, because it can be changed into a prime (101121002211127) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 314398375 + ... + 314719843.
It is an arithmetic number, because the mean of its divisors is an integer number (3565894402080).
Almost surely, 2101121002211121 is an apocalyptic number.
It is an amenable number.
101121002211121 is a deficient number, since it is larger than the sum of its proper divisors (12987618655439).
101121002211121 is a wasteful number, since it uses less digits than its factorization.
101121002211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338673.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101121002211121 its reverse (121112200121101), we get a palindrome (222233202332222).
The spelling of 101121002211121 in words is "one hundred one trillion, one hundred twenty-one billion, two million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •