Base | Representation |
---|---|
bin | 1011100100101110010111… |
… | …1111011100100101111111 |
3 | 1200001112212120200122202101 |
4 | 2321023211333130211333 |
5 | 3131443412221323112 |
6 | 43022012054005531 |
7 | 2452251015051424 |
oct | 271134577344577 |
9 | 50045776618671 |
10 | 12725551745407 |
11 | 4066970229a66 |
12 | 15163696468a7 |
13 | 714025794ab7 |
14 | 31dcc4651d4b |
15 | 17104a335757 |
hex | b92e5fdc97f |
12725551745407 has 4 divisors (see below), whose sum is σ = 12726414684936. Its totient is φ = 12724688805880.
The previous prime is 12725551745393. The next prime is 12725551745411. The reversal of 12725551745407 is 70454715552721.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12725551745407 - 231 = 12723404261759 is a prime.
It is a super-2 number, since 2×127255517454072 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12725551746407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 431447644 + ... + 431477137.
It is an arithmetic number, because the mean of its divisors is an integer number (3181603671234).
Almost surely, 212725551745407 is an apocalyptic number.
12725551745407 is a deficient number, since it is larger than the sum of its proper divisors (862939529).
12725551745407 is an equidigital number, since it uses as much as digits as its factorization.
12725551745407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862939528.
The product of its (nonzero) digits is 13720000, while the sum is 55.
The spelling of 12725551745407 in words is "twelve trillion, seven hundred twenty-five billion, five hundred fifty-one million, seven hundred forty-five thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •