Base | Representation |
---|---|
bin | 1011000011010110100001… |
… | …0110101010100000100101 |
3 | 1121000201222122011110211020 |
4 | 2300311220112222200211 |
5 | 3043100213043032013 |
6 | 41502352200201353 |
7 | 2362653113215623 |
oct | 260655026524045 |
9 | 47021878143736 |
10 | 12152213252133 |
11 | 39657a7634049 |
12 | 144321b769259 |
13 | 6a1c44660596 |
14 | 30025529a513 |
15 | 161190e88623 |
hex | b0d685aa825 |
12152213252133 has 16 divisors (see below), whose sum is σ = 16219948737216. Its totient is φ = 8092977742080.
The previous prime is 12152213252063. The next prime is 12152213252141. The reversal of 12152213252133 is 33125231225121.
It is not a de Polignac number, because 12152213252133 - 212 = 12152213248037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12152213252094 and 12152213252103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12152213252633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46479310 + ... + 46740032.
It is an arithmetic number, because the mean of its divisors is an integer number (1013746796076).
Almost surely, 212152213252133 is an apocalyptic number.
It is an amenable number.
12152213252133 is a deficient number, since it is larger than the sum of its proper divisors (4067735485083).
12152213252133 is a wasteful number, since it uses less digits than its factorization.
12152213252133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276964.
The product of its digits is 21600, while the sum is 33.
Adding to 12152213252133 its reverse (33125231225121), we get a palindrome (45277444477254).
The spelling of 12152213252133 in words is "twelve trillion, one hundred fifty-two billion, two hundred thirteen million, two hundred fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •