Base | Representation |
---|---|
bin | 11100111000010101… |
… | …110001010011001001 |
3 | 2222001010210022211002 |
4 | 130320111301103021 |
5 | 1002002030031441 |
6 | 22125031544345 |
7 | 2145312445310 |
oct | 347025612311 |
9 | 88033708732 |
10 | 31010002121 |
11 | 1217337962a |
12 | 601522b0b5 |
13 | 2c026c4aa7 |
14 | 170263b277 |
15 | c17633b9b |
hex | 7385714c9 |
31010002121 has 4 divisors (see below), whose sum is σ = 35440002432. Its totient is φ = 26580001812.
The previous prime is 31010002099. The next prime is 31010002123. The reversal of 31010002121 is 12120001013.
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, and also an emirpimes, since its reverse is a distinct semiprime: 12120001013 = 32719 ⋅370427.
It is not a de Polignac number, because 31010002121 - 210 = 31010001097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (31010002123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2215000145 + ... + 2215000158.
It is an arithmetic number, because the mean of its divisors is an integer number (8860000608).
Almost surely, 231010002121 is an apocalyptic number.
It is an amenable number.
31010002121 is a deficient number, since it is larger than the sum of its proper divisors (4430000311).
31010002121 is an equidigital number, since it uses as much as digits as its factorization.
31010002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4430000310.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 31010002121 its reverse (12120001013), we get a palindrome (43130003134).
The spelling of 31010002121 in words is "thirty-one billion, ten million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •