Base | Representation |
---|---|
bin | 1011011111001100110011… |
… | …0110001100101011101001 |
3 | 1122201110220001122102102000 |
4 | 2313303030312030223221 |
5 | 3123420022444010100 |
6 | 42510234115001213 |
7 | 2442351022524054 |
oct | 267631466145351 |
9 | 48643801572360 |
10 | 12630640610025 |
11 | 402a6963871a9 |
12 | 14bba9bb99209 |
13 | 7080ab359169 |
14 | 31947d3c5a9b |
15 | 16d842c57900 |
hex | b7cccd8cae9 |
12630640610025 has 96 divisors (see below), whose sum is σ = 23471225424000. Its totient is φ = 6658505441280.
The previous prime is 12630640609997. The next prime is 12630640610033. The reversal of 12630640610025 is 52001604603621.
12630640610025 is a `hidden beast` number, since 1 + 2 + 6 + 3 + 0 + 640 + 6 + 1 + 0 + 0 + 2 + 5 = 666.
It is not a de Polignac number, because 12630640610025 - 27 = 12630640609897 is a prime.
It is a super-2 number, since 2×126306406100252 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 195752169 + ... + 195816681.
It is an arithmetic number, because the mean of its divisors is an integer number (244491931500).
Almost surely, 212630640610025 is an apocalyptic number.
12630640610025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12630640610025 is a deficient number, since it is larger than the sum of its proper divisors (10840584813975).
12630640610025 is a wasteful number, since it uses less digits than its factorization.
12630640610025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67880 (or 67869 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 12630640610025 in words is "twelve trillion, six hundred thirty billion, six hundred forty million, six hundred ten thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •