Base | Representation |
---|---|
bin | 1011000011010101111110… |
… | …0110001101101101100101 |
3 | 1121000201121101201020101220 |
4 | 2300311133212031231211 |
5 | 3043044412440133131 |
6 | 41502325431210553 |
7 | 2362646350351551 |
oct | 260653746155545 |
9 | 47021541636356 |
10 | 12152066333541 |
11 | 3965731706a22 |
12 | 144319a516a59 |
13 | 6a1c200a00c4 |
14 | 30023d974861 |
15 | 161183116e96 |
hex | b0d5f98db65 |
12152066333541 has 4 divisors (see below), whose sum is σ = 16202755111392. Its totient is φ = 8101377555692.
The previous prime is 12152066333401. The next prime is 12152066333549. The reversal of 12152066333541 is 14533366025121.
It is a happy number.
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 12152066333541 - 210 = 12152066332517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12152066333493 and 12152066333502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12152066333549) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2025344388921 + ... + 2025344388926.
It is an arithmetic number, because the mean of its divisors is an integer number (4050688777848).
Almost surely, 212152066333541 is an apocalyptic number.
It is an amenable number.
12152066333541 is a deficient number, since it is larger than the sum of its proper divisors (4050688777851).
12152066333541 is an equidigital number, since it uses as much as digits as its factorization.
12152066333541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4050688777850.
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 12152066333541 in words is "twelve trillion, one hundred fifty-two billion, sixty-six million, three hundred thirty-three thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •