Base | Representation |
---|---|
bin | 1110000111000101111010… |
… | …11001001011100111111101 |
3 | 11001212102220112101020222121 |
4 | 13003202331121023213331 |
5 | 13031343440414210331 |
6 | 145554554525042541 |
7 | 6351562565443213 |
oct | 703427531134775 |
9 | 131772815336877 |
10 | 31030021241341 |
11 | 9983838048a01 |
12 | 35919ab3b6451 |
13 | 14411702c9305 |
14 | 793c0a9aacb3 |
15 | 38c266e62c11 |
hex | 1c38bd64b9fd |
31030021241341 has 4 divisors (see below), whose sum is σ = 31078279439872. Its totient is φ = 30981763042812.
The previous prime is 31030021241333. The next prime is 31030021241393. The reversal of 31030021241341 is 14314212003013.
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 a cyclic number.
It is not a de Polignac number, because 31030021241341 - 23 = 31030021241333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31030021241321) 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, 24129098301 + ... + 24129099586.
It is an arithmetic number, because the mean of its divisors is an integer number (7769569859968).
Almost surely, 231030021241341 is an apocalyptic number.
It is an amenable number.
31030021241341 is a deficient number, since it is larger than the sum of its proper divisors (48258198531).
31030021241341 is an equidigital number, since it uses as much as digits as its factorization.
31030021241341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48258198530.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 31030021241341 its reverse (14314212003013), we get a palindrome (45344233244354).
The spelling of 31030021241341 in words is "thirty-one trillion, thirty billion, twenty-one million, two hundred forty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •