Base | Representation |
---|---|
bin | 1110011110010… |
… | …01001100001001 |
3 | 22110110021122021 |
4 | 13033021030021 |
5 | 222040112223 |
6 | 20014124441 |
7 | 3002653633 |
oct | 717111411 |
9 | 273407567 |
10 | 121410313 |
11 | 62595402 |
12 | 347b0721 |
13 | 1c1cbb2b |
14 | 121a5a53 |
15 | a9d365d |
hex | 73c9309 |
121410313 has 8 divisors (see below), whose sum is σ = 123577160. Its totient is φ = 119249280.
The previous prime is 121410299. The next prime is 121410337. The reversal of 121410313 is 313014121.
It can be written as a sum of positive squares in 4 ways, for example, as 32353344 + 89056969 = 5688^2 + 9437^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121410313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121410013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74653 + ... + 76261.
It is an arithmetic number, because the mean of its divisors is an integer number (15447145).
Almost surely, 2121410313 is an apocalyptic number.
It is an amenable number.
121410313 is a deficient number, since it is larger than the sum of its proper divisors (2166847).
121410313 is a wasteful number, since it uses less digits than its factorization.
121410313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2907.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 121410313 is about 11018.6348065448. The cubic root of 121410313 is about 495.1671890438.
Adding to 121410313 its reverse (313014121), we get a palindrome (434424434).
The spelling of 121410313 in words is "one hundred twenty-one million, four hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •