Base | Representation |
---|---|
bin | 10010011111011… |
… | …001010101011001 |
3 | 210121201211000010 |
4 | 102133121111121 |
5 | 1113404020441 |
6 | 50441032133 |
7 | 10454553561 |
oct | 2237312531 |
9 | 717654003 |
10 | 310220121 |
11 | 14a124a72 |
12 | 87a85649 |
13 | 4c368903 |
14 | 2d2b3da1 |
15 | 1c37c116 |
hex | 127d9559 |
310220121 has 4 divisors (see below), whose sum is σ = 413626832. Its totient is φ = 206813412.
The previous prime is 310220111. The next prime is 310220137. The reversal of 310220121 is 121022013.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 310220121 - 25 = 310220089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 310220097 and 310220106.
It is not an unprimeable number, because it can be changed into a prime (310220111) 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, 51703351 + ... + 51703356.
It is an arithmetic number, because the mean of its divisors is an integer number (103406708).
Almost surely, 2310220121 is an apocalyptic number.
It is an amenable number.
310220121 is a deficient number, since it is larger than the sum of its proper divisors (103406711).
310220121 is a wasteful number, since it uses less digits than its factorization.
310220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103406710.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 310220121 is about 17613.0667687374. The cubic root of 310220121 is about 676.9500962134.
Adding to 310220121 its reverse (121022013), we get a palindrome (431242134).
It can be divided in two parts, 31022012 and 1, that added together give a palindrome (31022013).
The spelling of 310220121 in words is "three hundred ten million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •