Base | Representation |
---|---|
bin | 1011011110111000010000… |
… | …1011000100001110110111 |
3 | 1122200221122202122022220002 |
4 | 2313232010023010032313 |
5 | 3123322224323021000 |
6 | 42503523013501515 |
7 | 2442064254361112 |
oct | 267560413041667 |
9 | 48627582568802 |
10 | 12625126376375 |
11 | 4028316780907 |
12 | 14baa0134189b |
13 | 70770cb00906 |
14 | 3190b8d05579 |
15 | 16d61dac58d5 |
hex | b7b842c43b7 |
12625126376375 has 8 divisors (see below), whose sum is σ = 15756157717872. Its totient is φ = 10100101101000.
The previous prime is 12625126376371. The next prime is 12625126376411. The reversal of 12625126376375 is 57367362152621.
It is not a de Polignac number, because 12625126376375 - 22 = 12625126376371 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12625126376375.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12625126376371) 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 7 ways as a sum of consecutive naturals, for example, 50500505381 + ... + 50500505630.
It is an arithmetic number, because the mean of its divisors is an integer number (1969519714734).
Almost surely, 212625126376375 is an apocalyptic number.
12625126376375 is a deficient number, since it is larger than the sum of its proper divisors (3131031341497).
12625126376375 is an equidigital number, since it uses as much as digits as its factorization.
12625126376375 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101001011026 (or 101001011016 counting only the distinct ones).
The product of its digits is 19051200, while the sum is 56.
The spelling of 12625126376375 in words is "twelve trillion, six hundred twenty-five billion, one hundred twenty-six million, three hundred seventy-six thousand, three hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •