Base | Representation |
---|---|
bin | 11101000100100001… |
… | …010000011111001001 |
3 | 2222120101021202202012 |
4 | 131010201100133021 |
5 | 1002411332340131 |
6 | 22201211345305 |
7 | 2153343340553 |
oct | 350441203711 |
9 | 88511252665 |
10 | 31214340041 |
11 | 12268754745 |
12 | 6071752235 |
13 | 2c35b3a6c1 |
14 | 172182c4d3 |
15 | c2a54852b |
hex | 7448507c9 |
31214340041 has 4 divisors (see below), whose sum is σ = 31215336912. Its totient is φ = 31213343172.
The previous prime is 31214339963. The next prime is 31214340043. The reversal of 31214340041 is 14004341213.
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: 14004341213 = 359 ⋅39009307.
It is a cyclic number.
It is not a de Polignac number, because 31214340041 - 218 = 31214077897 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31214339989 and 31214340016.
It is not an unprimeable number, because it can be changed into a prime (31214340043) 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, 449891 + ... + 514616.
It is an arithmetic number, because the mean of its divisors is an integer number (7803834228).
Almost surely, 231214340041 is an apocalyptic number.
It is an amenable number.
31214340041 is a deficient number, since it is larger than the sum of its proper divisors (996871).
31214340041 is an equidigital number, since it uses as much as digits as its factorization.
31214340041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996870.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 31214340041 its reverse (14004341213), we get a palindrome (45218681254).
The spelling of 31214340041 in words is "thirty-one billion, two hundred fourteen million, three hundred forty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •