Base | Representation |
---|---|
bin | 101111000101101010… |
… | …1110100010011111001 |
3 | 100200000100212212001202 |
4 | 1132023111310103321 |
5 | 3124044213000441 |
6 | 114242123223545 |
7 | 10206616550612 |
oct | 1361325642371 |
9 | 320010785052 |
10 | 101122000121 |
11 | 3998180742a |
12 | 17721677bb5 |
13 | 96c70c403c |
14 | 4c74088c09 |
15 | 296c9b919b |
hex | 178b5744f9 |
101122000121 has 4 divisors (see below), whose sum is σ = 101122644132. Its totient is φ = 101121356112.
The previous prime is 101122000097. The next prime is 101122000139. The reversal of 101122000121 is 121000221101.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 39257874496 + 61864125625 = 198136^2 + 248725^2 .
It is a cyclic number.
It is not a de Polignac number, because 101122000121 - 226 = 101054891257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101122000171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85031 + ... + 457683.
It is an arithmetic number, because the mean of its divisors is an integer number (25280661033).
Almost surely, 2101122000121 is an apocalyptic number.
It is an amenable number.
101122000121 is a deficient number, since it is larger than the sum of its proper divisors (644011).
101122000121 is an equidigital number, since it uses as much as digits as its factorization.
101122000121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644010.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101122000121 its reverse (121000221101), we get a palindrome (222122221222).
The spelling of 101122000121 in words is "one hundred one billion, one hundred twenty-two million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •