Base | Representation |
---|---|
bin | 1011000011001110100100… |
… | …0001111111110000110101 |
3 | 1121000112110202200010000201 |
4 | 2300303221001333300311 |
5 | 3043031324221041413 |
6 | 41501400211440501 |
7 | 2362546144364656 |
oct | 260635101776065 |
9 | 47015422603021 |
10 | 12150077127733 |
11 | 3964900872186 |
12 | 14429242b6131 |
13 | 6a1993c34c4c |
14 | 3000d16c952d |
15 | 1610b86879dd |
hex | b0ce907fc35 |
12150077127733 has 4 divisors (see below), whose sum is σ = 12150090880128. Its totient is φ = 12150063375340.
The previous prime is 12150077127673. The next prime is 12150077127763. The reversal of 12150077127733 is 33772177005121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12150077127733 - 217 = 12150076996661 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12150077127763) 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 3 ways as a sum of consecutive naturals, for example, 5452741 + ... + 7350682.
It is an arithmetic number, because the mean of its divisors is an integer number (3037522720032).
Almost surely, 212150077127733 is an apocalyptic number.
It is an amenable number.
12150077127733 is a deficient number, since it is larger than the sum of its proper divisors (13752395).
12150077127733 is an equidigital number, since it uses as much as digits as its factorization.
12150077127733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13752394.
The product of its (nonzero) digits is 432180, while the sum is 46.
The spelling of 12150077127733 in words is "twelve trillion, one hundred fifty billion, seventy-seven million, one hundred twenty-seven thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •