Base | Representation |
---|---|
bin | 10001100111000000010… |
… | …011011100000101010101 |
3 | 11021200111210110121111010 |
4 | 101213000103130011111 |
5 | 124311302201201123 |
6 | 2323530130402433 |
7 | 153266464254513 |
oct | 21470023340525 |
9 | 4250453417433 |
10 | 1210112131413 |
11 | 427229829099 |
12 | 176640130419 |
13 | 8a1615a5713 |
14 | 427d95194b3 |
15 | 21727847993 |
hex | 119c04dc155 |
1210112131413 has 16 divisors (see below), whose sum is σ = 1722788559360. Its totient is φ = 753719991024.
The previous prime is 1210112131409. The next prime is 1210112131489. The reversal of 1210112131413 is 3141312110121.
It is a happy number.
It is not a de Polignac number, because 1210112131413 - 22 = 1210112131409 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1210112131413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210112131493) 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 15 ways as a sum of consecutive naturals, for example, 203925603 + ... + 203931536.
It is an arithmetic number, because the mean of its divisors is an integer number (107674284960).
Almost surely, 21210112131413 is an apocalyptic number.
It is an amenable number.
1210112131413 is a deficient number, since it is larger than the sum of its proper divisors (512676427947).
1210112131413 is a wasteful number, since it uses less digits than its factorization.
1210112131413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 407857208.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 1210112131413 its reverse (3141312110121), we get a palindrome (4351424241534).
The spelling of 1210112131413 in words is "one trillion, two hundred ten billion, one hundred twelve million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •