Base | Representation |
---|---|
bin | 1001000001110010110… |
… | …11010101011000111001 |
3 | 1002122200110010012211120 |
4 | 10200321123111120321 |
5 | 20040242441041441 |
6 | 354300542215453 |
7 | 31261033643115 |
oct | 4407133253071 |
9 | 1078613105746 |
10 | 310201112121 |
11 | 10a61249387a |
12 | 50151884589 |
13 | 233373a2624 |
14 | 11029c96745 |
15 | 8108045966 |
hex | 48396d5639 |
310201112121 has 16 divisors (see below), whose sum is σ = 415599585600. Its totient is φ = 205802463168.
The previous prime is 310201112083. The next prime is 310201112147. The reversal of 310201112121 is 121211102013.
It is not a de Polignac number, because 310201112121 - 27 = 310201111993 is a prime.
It is a super-2 number, since 2×3102011121212 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 310201112121.
It is not an unprimeable number, because it can be changed into a prime (310201113121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1531575 + ... + 1722243.
It is an arithmetic number, because the mean of its divisors is an integer number (25974974100).
Almost surely, 2310201112121 is an apocalyptic number.
It is an amenable number.
310201112121 is a deficient number, since it is larger than the sum of its proper divisors (105398473479).
310201112121 is a wasteful number, since it uses less digits than its factorization.
310201112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193288.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 310201112121 its reverse (121211102013), we get a palindrome (431412214134).
The spelling of 310201112121 in words is "three hundred ten billion, two hundred one million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •