Base | Representation |
---|---|
bin | 1100111010110111101110… |
… | …1001000100010100010001 |
3 | 1212022000221220011021100112 |
4 | 3032231323221010110101 |
5 | 3330220411442223100 |
6 | 50113533030131105 |
7 | 2664213210000200 |
oct | 316557351042421 |
9 | 55260856137315 |
10 | 14205531211025 |
11 | 4587594038570 |
12 | 17151637b0a95 |
13 | 7c076419404b |
14 | 3717a0dad237 |
15 | 1997b9c59b35 |
hex | ceb7ba44511 |
14205531211025 has 36 divisors (see below), whose sum is σ = 22353549839280. Its totient is φ = 8855396071200.
The previous prime is 14205531210973. The next prime is 14205531211033. The reversal of 14205531211025 is 52011213550241.
14205531211025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14205531211025 - 240 = 13106019583249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14205531210982 and 14205531211000.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 527093435 + ... + 527120384.
It is an arithmetic number, because the mean of its divisors is an integer number (620931939980).
Almost surely, 214205531211025 is an apocalyptic number.
It is an amenable number.
14205531211025 is a deficient number, since it is larger than the sum of its proper divisors (8148018628255).
14205531211025 is a wasteful number, since it uses less digits than its factorization.
14205531211025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1054213854 (or 1054213842 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 14205531211025 its reverse (52011213550241), we get a palindrome (66216744761266).
The spelling of 14205531211025 in words is "fourteen trillion, two hundred five billion, five hundred thirty-one million, two hundred eleven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •