Base | Representation |
---|---|
bin | 10000001010111101110100… |
… | …001001111111100110100011 |
3 | 100022211020010020002022212112 |
4 | 100022331310021333212203 |
5 | 33310231443412400311 |
6 | 411133050021345535 |
7 | 20660263125140504 |
oct | 2012756411774643 |
9 | 308736106068775 |
10 | 71122312231331 |
11 | 20730892110819 |
12 | 7b87b925682ab |
13 | 308ba6122510a |
14 | 137c4a4348bab |
15 | 8350c41ed28b |
hex | 40af7427f9a3 |
71122312231331 has 4 divisors (see below), whose sum is σ = 72635552917152. Its totient is φ = 69609071545512.
The previous prime is 71122312231319. The next prime is 71122312231339. The reversal of 71122312231331 is 13313221322117.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 71122312231331 - 218 = 71122311969187 is a prime.
It is a super-2 number, since 2×711223122313312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (71122312231339) 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, 756620342840 + ... + 756620342933.
It is an arithmetic number, because the mean of its divisors is an integer number (18158888229288).
Almost surely, 271122312231331 is an apocalyptic number.
71122312231331 is a deficient number, since it is larger than the sum of its proper divisors (1513240685821).
71122312231331 is a wasteful number, since it uses less digits than its factorization.
71122312231331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1513240685820.
The product of its digits is 9072, while the sum is 32.
Adding to 71122312231331 its reverse (13313221322117), we get a palindrome (84435533553448).
The spelling of 71122312231331 in words is "seventy-one trillion, one hundred twenty-two billion, three hundred twelve million, two hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •