Base | Representation |
---|---|
bin | 1100010010101111111000… |
… | …0110101000000101101111 |
3 | 1202212010202022211000222110 |
4 | 3010223332012220011233 |
5 | 3232422214421410101 |
6 | 44425134230415103 |
7 | 2563341533421360 |
oct | 304537606500557 |
9 | 52763668730873 |
10 | 13516230263151 |
11 | 4341223686110 |
12 | 1623652201493 |
13 | 7707624b13a5 |
14 | 34a2909d9b67 |
15 | 1868c50e6cd6 |
hex | c4afe1a816f |
13516230263151 has 32 divisors (see below), whose sum is σ = 22468746014208. Its totient is φ = 7021353507840.
The previous prime is 13516230263113. The next prime is 13516230263209. The reversal of 13516230263151 is 15136203261531.
It is not a de Polignac number, because 13516230263151 - 26 = 13516230263087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13516230263251) 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 31 ways as a sum of consecutive naturals, for example, 34453335 + ... + 34843431.
It is an arithmetic number, because the mean of its divisors is an integer number (702148312944).
Almost surely, 213516230263151 is an apocalyptic number.
13516230263151 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13516230263151 is a deficient number, since it is larger than the sum of its proper divisors (8952515751057).
13516230263151 is a wasteful number, since it uses less digits than its factorization.
13516230263151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540111.
The product of its (nonzero) digits is 97200, while the sum is 39.
The spelling of 13516230263151 in words is "thirteen trillion, five hundred sixteen billion, two hundred thirty million, two hundred sixty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •