Base | Representation |
---|---|
bin | 10001100111000001100… |
… | …111110010011111111001 |
3 | 11021200120100002000022200 |
4 | 101213001213302133321 |
5 | 124311323331241241 |
6 | 2323532240340413 |
7 | 153300153230643 |
oct | 21470147623771 |
9 | 4250510060280 |
10 | 1210134243321 |
11 | 4272402610a3 |
12 | 176647614709 |
13 | 8a1660481a3 |
14 | 427dc433893 |
15 | 217297644b6 |
hex | 119c19f27f9 |
1210134243321 has 24 divisors (see below), whose sum is σ = 1758050218080. Its totient is φ = 802106140416.
The previous prime is 1210134243299. The next prime is 1210134243401. The reversal of 1210134243321 is 1233424310121.
1210134243321 is a `hidden beast` number, since 1 + 210 + 1 + 3 + 424 + 3 + 3 + 21 = 666.
It is not a de Polignac number, because 1210134243321 - 26 = 1210134243257 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1210134243421) 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 23 ways as a sum of consecutive naturals, for example, 9387721 + ... + 9515753.
It is an arithmetic number, because the mean of its divisors is an integer number (73252092420).
Almost surely, 21210134243321 is an apocalyptic number.
It is an amenable number.
1210134243321 is a deficient number, since it is larger than the sum of its proper divisors (547915974759).
1210134243321 is a wasteful number, since it uses less digits than its factorization.
1210134243321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134085 (or 134082 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1210134243321 its reverse (1233424310121), we get a palindrome (2443558553442).
The spelling of 1210134243321 in words is "one trillion, two hundred ten billion, one hundred thirty-four million, two hundred forty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •