Base | Representation |
---|---|
bin | 11001000000000011… |
… | …01111111100001111 |
3 | 1021122102021222221012 |
4 | 30200001233330033 |
5 | 204442042400221 |
6 | 10055512555435 |
7 | 653421040466 |
oct | 144001577417 |
9 | 37572258835 |
10 | 13422231311 |
11 | 5768555055 |
12 | 27270b2b7b |
13 | 135b9c8208 |
14 | 9148799dd |
15 | 53855765b |
hex | 32006ff0f |
13422231311 has 8 divisors (see below), whose sum is σ = 13529053824. Its totient is φ = 13315475160.
The previous prime is 13422231247. The next prime is 13422231331. The reversal of 13422231311 is 11313222431.
13422231311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13422231311 - 26 = 13422231247 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 (13422231331) 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 7 ways as a sum of consecutive naturals, for example, 438860 + ... + 468446.
It is an arithmetic number, because the mean of its divisors is an integer number (1691131728).
Almost surely, 213422231311 is an apocalyptic number.
13422231311 is a deficient number, since it is larger than the sum of its proper divisors (106822513).
13422231311 is a wasteful number, since it uses less digits than its factorization.
13422231311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33181.
The product of its digits is 864, while the sum is 23.
Adding to 13422231311 its reverse (11313222431), we get a palindrome (24735453742).
The spelling of 13422231311 in words is "thirteen billion, four hundred twenty-two million, two hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •