Base | Representation |
---|---|
bin | 10110101000101101… |
… | …01010001011001101 |
3 | 1011100221100021222002 |
4 | 23110112222023031 |
5 | 144342034104201 |
6 | 5325521202045 |
7 | 610103525600 |
oct | 132426521315 |
9 | 34327307862 |
10 | 12152644301 |
11 | 517693a596 |
12 | 2431a90325 |
13 | 11b897b1b5 |
14 | 833dd4337 |
15 | 4b1d7376b |
hex | 2d45aa2cd |
12152644301 has 12 divisors (see below), whose sum is σ = 14158174140. Its totient is φ = 10400765760.
The previous prime is 12152644291. The next prime is 12152644337. The reversal of 12152644301 is 10344625121.
12152644301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 8691087076 + 3461557225 = 93226^2 + 58835^2 .
It is not a de Polignac number, because 12152644301 - 210 = 12152643277 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 (12152644201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 155216 + ... + 219993.
It is an arithmetic number, because the mean of its divisors is an integer number (1179847845).
Almost surely, 212152644301 is an apocalyptic number.
It is an amenable number.
12152644301 is a deficient number, since it is larger than the sum of its proper divisors (2005529839).
12152644301 is an equidigital number, since it uses as much as digits as its factorization.
12152644301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375884 (or 375877 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 29.
The spelling of 12152644301 in words is "twelve billion, one hundred fifty-two million, six hundred forty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •