Base | Representation |
---|---|
bin | 1011000011110111110001… |
… | …1000100111101000001101 |
3 | 1121001121000200222211010022 |
4 | 2300331330120213220031 |
5 | 3043222003121243113 |
6 | 41510430015151525 |
7 | 2363420236666310 |
oct | 260757430475015 |
9 | 47047020884108 |
10 | 12161139243533 |
11 | 3969568076545 |
12 | 1444ab0b155a5 |
13 | 6a2a3799a5b7 |
14 | 300860928977 |
15 | 1615148e6908 |
hex | b0f7c627a0d |
12161139243533 has 4 divisors (see below), whose sum is σ = 13898444849760. Its totient is φ = 10423833637308.
The previous prime is 12161139243529. The next prime is 12161139243571. The reversal of 12161139243533 is 33534293116121.
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 not a de Polignac number, because 12161139243533 - 22 = 12161139243529 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 (12161136243533) 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, 868652803103 + ... + 868652803116.
It is an arithmetic number, because the mean of its divisors is an integer number (3474611212440).
Almost surely, 212161139243533 is an apocalyptic number.
It is an amenable number.
12161139243533 is a deficient number, since it is larger than the sum of its proper divisors (1737305606227).
12161139243533 is an equidigital number, since it uses as much as digits as its factorization.
12161139243533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1737305606226.
The product of its digits is 349920, while the sum is 44.
The spelling of 12161139243533 in words is "twelve trillion, one hundred sixty-one billion, one hundred thirty-nine million, two hundred forty-three thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •