Base | Representation |
---|---|
bin | 10001100111000001100… |
… | …000000111001101100101 |
3 | 11021200120012021202221202 |
4 | 101213001200013031211 |
5 | 124311322322343023 |
6 | 2323532125252245 |
7 | 153300130150106 |
oct | 21470140071545 |
9 | 4250505252852 |
10 | 1210132231013 |
11 | 42723a107232 |
12 | 176646a04085 |
13 | 8a1657c2284 |
14 | 427dc06c3ad |
15 | 217294b8128 |
hex | 119c1807365 |
1210132231013 has 8 divisors (see below), whose sum is σ = 1216520025600. Its totient is φ = 1203744978720.
The previous prime is 1210132230953. The next prime is 1210132231027. The reversal of 1210132231013 is 3101322310121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1210132231013 - 210 = 1210132229989 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 (1210132231043) 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 7 ways as a sum of consecutive naturals, for example, 4814606 + ... + 5059712.
It is an arithmetic number, because the mean of its divisors is an integer number (152065003200).
Almost surely, 21210132231013 is an apocalyptic number.
It is an amenable number.
1210132231013 is a deficient number, since it is larger than the sum of its proper divisors (6387794587).
1210132231013 is a wasteful number, since it uses less digits than its factorization.
1210132231013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271147.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1210132231013 its reverse (3101322310121), we get a palindrome (4311454541134).
The spelling of 1210132231013 in words is "one trillion, two hundred ten billion, one hundred thirty-two million, two hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •