Base | Representation |
---|---|
bin | 10110111111010111111111… |
… | …111111110001010001101001 |
3 | 111021000020001111100012202122 |
4 | 112333113333333301101221 |
5 | 101223110110211201441 |
6 | 555014133334241025 |
7 | 30204052410306245 |
oct | 2677277777612151 |
9 | 437006044305678 |
10 | 101112120022121 |
11 | 2a24345584617a |
12 | b4102584b6175 |
13 | 4455aa7bb9a30 |
14 | 1ad7bd1c1b425 |
15 | ba52592ed34b |
hex | 5bf5ffff1469 |
101112120022121 has 32 divisors (see below), whose sum is σ = 112735221984000. Its totient is φ = 90043529925888.
The previous prime is 101112120022091. The next prime is 101112120022157. The reversal of 101112120022121 is 121220021211101.
It is a cyclic number.
It is not a de Polignac number, because 101112120022121 - 26 = 101112120022057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101112120022121.
It is not an unprimeable number, because it can be changed into a prime (101112120022181) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3530067026 + ... + 3530095668.
It is an arithmetic number, because the mean of its divisors is an integer number (3522975687000).
Almost surely, 2101112120022121 is an apocalyptic number.
It is an amenable number.
101112120022121 is a deficient number, since it is larger than the sum of its proper divisors (11623101961879).
101112120022121 is a wasteful number, since it uses less digits than its factorization.
101112120022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35873.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101112120022121 its reverse (121220021211101), we get a palindrome (222332141233222).
The spelling of 101112120022121 in words is "one hundred one trillion, one hundred twelve billion, one hundred twenty million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •