Base | Representation |
---|---|
bin | 10110011100100110… |
… | …00000110110101001 |
3 | 1011002212010111221011 |
4 | 23032103000312221 |
5 | 144140030302241 |
6 | 5311451143521 |
7 | 604431011416 |
oct | 131623006651 |
9 | 34085114834 |
10 | 12051025321 |
11 | 5124542765 |
12 | 2403a44ba1 |
13 | 11a08bb81a |
14 | 82470110d |
15 | 4a7e9e281 |
hex | 2ce4c0da9 |
12051025321 has 4 divisors (see below), whose sum is σ = 12220758144. Its totient is φ = 11881292500.
The previous prime is 12051025309. The next prime is 12051025381. The reversal of 12051025321 is 12352015021.
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, and also an emirpimes, since its reverse is a distinct semiprime: 12352015021 = 131 ⋅94290191.
It is a cyclic number.
It is not a de Polignac number, because 12051025321 - 27 = 12051025193 is a prime.
It is a super-2 number, since 2×120510253212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12051025292 and 12051025301.
It is not an unprimeable number, because it can be changed into a prime (12051025381) 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, 84866305 + ... + 84866446.
It is an arithmetic number, because the mean of its divisors is an integer number (3055189536).
Almost surely, 212051025321 is an apocalyptic number.
It is an amenable number.
12051025321 is a deficient number, since it is larger than the sum of its proper divisors (169732823).
12051025321 is an equidigital number, since it uses as much as digits as its factorization.
12051025321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169732822.
The product of its (nonzero) digits is 600, while the sum is 22.
The spelling of 12051025321 in words is "twelve billion, fifty-one million, twenty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •