Base | Representation |
---|---|
bin | 1100000001101001110011… |
… | …1000010000111000111111 |
3 | 1201211001200122021112012012 |
4 | 3000122130320100320333 |
5 | 3213114231040111111 |
6 | 44042203541401435 |
7 | 2533203620614523 |
oct | 300323470207077 |
9 | 51731618245165 |
10 | 13222541332031 |
11 | 4238714964319 |
12 | 159674a40927b |
13 | 74bb5a023585 |
14 | 339d8db1bd83 |
15 | 17de36a1948b |
hex | c069ce10e3f |
13222541332031 has 8 divisors (see below), whose sum is σ = 14078552062320. Its totient is φ = 12375221066368.
The previous prime is 13222541332027. The next prime is 13222541332069. The reversal of 13222541332031 is 13023314522231.
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 13222541332031 - 22 = 13222541332027 is a prime.
It is a super-2 number, since 2×132225413320312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13222541392031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2172613016 + ... + 2172619101.
It is an arithmetic number, because the mean of its divisors is an integer number (1759819007790).
Almost surely, 213222541332031 is an apocalyptic number.
13222541332031 is a deficient number, since it is larger than the sum of its proper divisors (856010730289).
13222541332031 is a wasteful number, since it uses less digits than its factorization.
13222541332031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4345232313.
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 13222541332031 its reverse (13023314522231), we get a palindrome (26245855854262).
The spelling of 13222541332031 in words is "thirteen trillion, two hundred twenty-two billion, five hundred forty-one million, three hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •