Base | Representation |
---|---|
bin | 1100000011010100000000… |
… | …1100100110111001010111 |
3 | 1201220210021112112121000120 |
4 | 3000311000030212321113 |
5 | 3214101123043430111 |
6 | 44103240542043023 |
7 | 2535233254250154 |
oct | 300650014467127 |
9 | 51823245477016 |
10 | 13251051155031 |
11 | 4249814a17308 |
12 | 15a0186279473 |
13 | 751751755521 |
14 | 33b4d629d22b |
15 | 17ea548d9406 |
hex | c0d40326e57 |
13251051155031 has 16 divisors (see below), whose sum is σ = 17677526269440. Its totient is φ = 8829305513280.
The previous prime is 13251051155029. The next prime is 13251051155063. The reversal of 13251051155031 is 13055115015231.
It is not a de Polignac number, because 13251051155031 - 21 = 13251051155029 is a prime.
It is a super-2 number, since 2×132510511550312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13251051154983 and 13251051155001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13251051105031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 161126640 + ... + 161208858.
It is an arithmetic number, because the mean of its divisors is an integer number (1104845391840).
Almost surely, 213251051155031 is an apocalyptic number.
13251051155031 is a deficient number, since it is larger than the sum of its proper divisors (4426475114409).
13251051155031 is a wasteful number, since it uses less digits than its factorization.
13251051155031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110326.
The product of its (nonzero) digits is 11250, while the sum is 33.
The spelling of 13251051155031 in words is "thirteen trillion, two hundred fifty-one billion, fifty-one million, one hundred fifty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •