Base | Representation |
---|---|
bin | 101111001000000001… |
… | …1001110010110011001 |
3 | 100200012212120002011010 |
4 | 1132100003032112121 |
5 | 3124224424341441 |
6 | 114254024524133 |
7 | 10211566260366 |
oct | 1362003162631 |
9 | 320185502133 |
10 | 101201012121 |
11 | 39a12373300 |
12 | 17744020649 |
13 | 970a5997c1 |
14 | 4c8077546d |
15 | 29748c5116 |
hex | 17900ce599 |
101201012121 has 96 divisors (see below), whose sum is σ = 166208716800. Its totient is φ = 54389491200.
The previous prime is 101201012113. The next prime is 101201012137. The reversal of 101201012121 is 121210102101.
It is not a de Polignac number, because 101201012121 - 23 = 101201012113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101201012097 and 101201012106.
It is not an unprimeable number, because it can be changed into a prime (101201012821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 22392300 + ... + 22396818.
It is an arithmetic number, because the mean of its divisors is an integer number (1731340800).
Almost surely, 2101201012121 is an apocalyptic number.
101201012121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101201012121 is a deficient number, since it is larger than the sum of its proper divisors (65007704679).
101201012121 is a wasteful number, since it uses less digits than its factorization.
101201012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4771 (or 4760 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101201012121 its reverse (121210102101), we get a palindrome (222411114222).
The spelling of 101201012121 in words is "one hundred one billion, two hundred one million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •