10121 has 4 divisors (see below), whose sum is σ = 10500. Its totient is φ = 9744.
The previous prime is 10111. The next prime is 10133. The reversal of 10121 is 12101.
It is a happy number.
10121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
10121 is an esthetic number in base 10, because in such base its adjacent digits differ by 1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6400 + 3721 = 80^2 + 61^2 .
It is a de Polignac number, because none of the positive numbers 2k-10121 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a plaindrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (10111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 146 + ... + 203.
It is an arithmetic number, because the mean of its divisors is an integer number (2625).
210121 is an apocalyptic number.
It is an amenable number.
10121 is a deficient number, since it is larger than the sum of its proper divisors (379).
10121 is an equidigital number, since it uses as much as digits as its factorization.
10121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378.
The product of its (nonzero) digits is 2, while the sum is 5.
The square root of 10121 is about 100.6031808642. The cubic root of 10121 is about 21.6308942913.
Adding to 10121 its reverse (12101), we get a palindrome (22222).
Multiplying 10121 by its reverse (12101), we get a palindrome (122474221).
It can be divided in two parts, 10 and 121, that added together give a palindrome (131).
The spelling of 10121 in words is "ten thousand, one hundred twenty-one", and thus it is an iban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •