Base | Representation |
---|---|
bin | 1011100100001000111000… |
… | …0011011011110010100101 |
3 | 1200000120220010002020101110 |
4 | 2321002032003123302211 |
5 | 3131312304013223333 |
6 | 43013225220015233 |
7 | 2451443415413253 |
oct | 271021603336245 |
9 | 50016803066343 |
10 | 12715486461093 |
11 | 4062675684979 |
12 | 151441a831519 |
13 | 7130b03ca370 |
14 | 31d60b9775d3 |
15 | 170b5b87e063 |
hex | b908e0dbca5 |
12715486461093 has 32 divisors (see below), whose sum is σ = 19473252978816. Its totient is φ = 7310869198848.
The previous prime is 12715486461079. The next prime is 12715486461113. The reversal of 12715486461093 is 39016468451721.
It is not a de Polignac number, because 12715486461093 - 29 = 12715486460581 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12715486461023) 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, 69904471 + ... + 70086132.
It is an arithmetic number, because the mean of its divisors is an integer number (608539155588).
It is a 2-persistent number, because it is pandigital, and so is 2⋅12715486461093 = 25430972922186, but 3⋅12715486461093 = 38146459383279 is not.
Almost surely, 212715486461093 is an apocalyptic number.
12715486461093 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12715486461093 is a deficient number, since it is larger than the sum of its proper divisors (6757766517723).
12715486461093 is a wasteful number, since it uses less digits than its factorization.
12715486461093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139990773.
The product of its (nonzero) digits is 8709120, while the sum is 57.
The spelling of 12715486461093 in words is "twelve trillion, seven hundred fifteen billion, four hundred eighty-six million, four hundred sixty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •