Base | Representation |
---|---|
bin | 1011111000010111100101… |
… | …0101001110001010010101 |
3 | 1201020210222002201212122210 |
4 | 2332011321111032022111 |
5 | 3203011041433401201 |
6 | 43441023524544033 |
7 | 2515526042512623 |
oct | 276057125161225 |
9 | 51223862655583 |
10 | 13063031153301 |
11 | 4187000596128 |
12 | 156b852852019 |
13 | 739ab93b6a2c |
14 | 33237b2b0513 |
15 | 179bed0841d6 |
hex | be17954e295 |
13063031153301 has 16 divisors (see below), whose sum is σ = 18694555467264. Its totient is φ = 8084132089344.
The previous prime is 13063031153287. The next prime is 13063031153309. The reversal of 13063031153301 is 10335113036031.
It is not a de Polignac number, because 13063031153301 - 27 = 13063031153173 is a prime.
It is a super-2 number, since 2×130630311533012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13063031153309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1754365221 + ... + 1754372666.
It is an arithmetic number, because the mean of its divisors is an integer number (1168409716704).
Almost surely, 213063031153301 is an apocalyptic number.
It is an amenable number.
13063031153301 is a deficient number, since it is larger than the sum of its proper divisors (5631524313963).
13063031153301 is a wasteful number, since it uses less digits than its factorization.
13063031153301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3508737980.
The product of its (nonzero) digits is 7290, while the sum is 30.
Adding to 13063031153301 its reverse (10335113036031), we get a palindrome (23398144189332).
The spelling of 13063031153301 in words is "thirteen trillion, sixty-three billion, thirty-one million, one hundred fifty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •