Base | Representation |
---|---|
bin | 1011110101010010100001… |
… | …0011011101110111111001 |
3 | 1201001202102110220010111111 |
4 | 2331110220103131313321 |
5 | 3201124222311200241 |
6 | 43400434443200321 |
7 | 2511644126322013 |
oct | 275245023356771 |
9 | 51052373803444 |
10 | 13010132131321 |
11 | 4166625461a46 |
12 | 156154ab160a1 |
13 | 734b08b594b0 |
14 | 32d99d9411b3 |
15 | 178653e44c81 |
hex | bd5284dddf9 |
13010132131321 has 32 divisors (see below), whose sum is σ = 14676848524800. Its totient is φ = 11454663477504.
The previous prime is 13010132131313. The next prime is 13010132131349. The reversal of 13010132131321 is 12313123101031.
It is not a de Polignac number, because 13010132131321 - 23 = 13010132131313 is a prime.
It is a super-2 number, since 2×130101321313212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13010132131292 and 13010132131301.
It is not an unprimeable number, because it can be changed into a prime (13010132131021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3476886 + ... + 6173248.
It is an arithmetic number, because the mean of its divisors is an integer number (458651516400).
Almost surely, 213010132131321 is an apocalyptic number.
It is an amenable number.
13010132131321 is a deficient number, since it is larger than the sum of its proper divisors (1666716393479).
13010132131321 is a wasteful number, since it uses less digits than its factorization.
13010132131321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2696625.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13010132131321 its reverse (12313123101031), we get a palindrome (25323255232352).
The spelling of 13010132131321 in words is "thirteen trillion, ten billion, one hundred thirty-two million, one hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •