Base | Representation |
---|---|
bin | 11000101011101101… |
… | …11001100111111111 |
3 | 1021012112020210200010 |
4 | 30111312321213333 |
5 | 204114403141411 |
6 | 10030540034303 |
7 | 646246604511 |
oct | 142566714777 |
9 | 37175223603 |
10 | 13251615231 |
11 | 5690211728 |
12 | 2699b32993 |
13 | 133255b65a |
14 | 8d9d45bb1 |
15 | 5285a47a6 |
hex | 315db99ff |
13251615231 has 16 divisors (see below), whose sum is σ = 18156161664. Its totient is φ = 8590997664.
The previous prime is 13251615199. The next prime is 13251615253.
13251615231 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13251615231 - 25 = 13251615199 is a prime.
It is a super-2 number, since 2×132516152312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13251615031) 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, 180376 + ... + 242978.
It is an arithmetic number, because the mean of its divisors is an integer number (1134760104).
Almost surely, 213251615231 is an apocalyptic number.
13251615231 is a deficient number, since it is larger than the sum of its proper divisors (4904546433).
13251615231 is a wasteful number, since it uses less digits than its factorization.
13251615231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64550.
The product of its digits is 5400, while the sum is 30.
The spelling of 13251615231 in words is "thirteen billion, two hundred fifty-one million, six hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •