Base | Representation |
---|---|
bin | 1011111011110100011111… |
… | …1100011111111111111001 |
3 | 1201110111000212222200112001 |
4 | 2332331013330133333321 |
5 | 3204444014011200241 |
6 | 43524152142421001 |
7 | 2523025423511440 |
oct | 276750774377771 |
9 | 51414025880461 |
10 | 13122332131321 |
11 | 41aa171431676 |
12 | 157b242591761 |
13 | 74257a087a3a |
14 | 3351a4da1d57 |
15 | 17b51e259431 |
hex | bef47f1fff9 |
13122332131321 has 8 divisors (see below), whose sum is σ = 14997573299520. Its totient is φ = 11247246536208.
The previous prime is 13122332131301. The next prime is 13122332131357. The reversal of 13122332131321 is 12313123322131.
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 13122332131321 - 25 = 13122332131289 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13122332131321.
It is not an unprimeable number, because it can be changed into a prime (13122332131301) 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, 38712466 + ... + 39049963.
It is an arithmetic number, because the mean of its divisors is an integer number (1874696662440).
Almost surely, 213122332131321 is an apocalyptic number.
It is an amenable number.
13122332131321 is a deficient number, since it is larger than the sum of its proper divisors (1875241168199).
13122332131321 is an equidigital number, since it uses as much as digits as its factorization.
13122332131321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77786543.
The product of its digits is 3888, while the sum is 28.
Adding to 13122332131321 its reverse (12313123322131), we get a palindrome (25435455453452).
The spelling of 13122332131321 in words is "thirteen trillion, one hundred twenty-two billion, three hundred thirty-two million, one hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •