Base | Representation |
---|---|
bin | 1011100100001000111000… |
… | …0011011101011110111001 |
3 | 1200000120220010002120220012 |
4 | 2321002032003131132321 |
5 | 3131312304013434100 |
6 | 43013225220111305 |
7 | 2451443415442415 |
oct | 271021603353671 |
9 | 50016803076805 |
10 | 12715486468025 |
11 | 406267568a100 |
12 | 151441a835535 |
13 | 7130b0400573 |
14 | 31d60b979d45 |
15 | 170b5b881135 |
hex | b908e0dd7b9 |
12715486468025 has 36 divisors (see below), whose sum is σ = 17331520724700. Its totient is φ = 9247291468800.
The previous prime is 12715486467977. The next prime is 12715486468031. The reversal of 12715486468025 is 52086468451721.
It can be written as a sum of positive squares in 6 ways, for example, as 964329892009 + 11751156576016 = 982003^2 + 3427996^2 .
It is not a de Polignac number, because 12715486468025 - 212 = 12715486463929 is a prime.
It is a super-2 number, since 2×127154864680252 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (59) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 109474181 + ... + 109590269.
Almost surely, 212715486468025 is an apocalyptic number.
It is an amenable number.
12715486468025 is a deficient number, since it is larger than the sum of its proper divisors (4616034256675).
12715486468025 is a wasteful number, since it uses less digits than its factorization.
12715486468025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152330 (or 152314 counting only the distinct ones).
The product of its (nonzero) digits is 25804800, while the sum is 59.
The spelling of 12715486468025 in words is "twelve trillion, seven hundred fifteen billion, four hundred eighty-six million, four hundred sixty-eight thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •