Base | Representation |
---|---|
bin | 1011010111101101101110… |
… | …1011110111101100111011 |
3 | 1122021011221200221002110000 |
4 | 2311323123223313230323 |
5 | 3114313134334321021 |
6 | 42331205205124043 |
7 | 2430146135140056 |
oct | 265733353675473 |
9 | 48234850832400 |
10 | 12502040542011 |
11 | 3a900a3a5a759 |
12 | 149ab900b9623 |
13 | 6c8c2550b167 |
14 | 31315dc11a9d |
15 | 16a317c73b26 |
hex | b5edbaf7b3b |
12502040542011 has 10 divisors (see below), whose sum is σ = 18675887723372. Its totient is φ = 8334693694620.
The previous prime is 12502040541973. The next prime is 12502040542081. The reversal of 12502040542011 is 11024504020521.
It is a happy number.
12502040542011 is a `hidden beast` number, since 1 + 2 + 50 + 2 + 0 + 405 + 4 + 201 + 1 = 666.
It is not a de Polignac number, because 12502040542011 - 222 = 12502036347707 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12502040542081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 77173089685 + ... + 77173089846.
Almost surely, 212502040542011 is an apocalyptic number.
12502040542011 is a deficient number, since it is larger than the sum of its proper divisors (6173847181361).
12502040542011 is an equidigital number, since it uses as much as digits as its factorization.
12502040542011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154346179543 (or 154346179534 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 12502040542011 its reverse (11024504020521), we get a palindrome (23526544562532).
The spelling of 12502040542011 in words is "twelve trillion, five hundred two billion, forty million, five hundred forty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •