Base | Representation |
---|---|
bin | 10000010101000011001… |
… | …001011011101000100101 |
3 | 10222021100222121002002000 |
4 | 100111003021123220211 |
5 | 121341041412311323 |
6 | 2215254104035513 |
7 | 144033002133036 |
oct | 20250311335045 |
9 | 3867328532060 |
10 | 1122113010213 |
11 | 3a29815a4948 |
12 | 161581462b99 |
13 | 81a791777c0 |
14 | 3c44c264a8d |
15 | 1e2c6ea3e43 |
hex | 1054325ba25 |
1122113010213 has 32 divisors (see below), whose sum is σ = 1790332992000. Its totient is φ = 690505155648.
The previous prime is 1122113010181. The next prime is 1122113010229. The reversal of 1122113010213 is 3120103112211.
It is not a de Polignac number, because 1122113010213 - 25 = 1122113010181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122113010283) 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 31 ways as a sum of consecutive naturals, for example, 13960263 + ... + 14040411.
It is an arithmetic number, because the mean of its divisors is an integer number (55947906000).
Almost surely, 21122113010213 is an apocalyptic number.
1122113010213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1122113010213 is a deficient number, since it is larger than the sum of its proper divisors (668219981787).
1122113010213 is a wasteful number, since it uses less digits than its factorization.
1122113010213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120058 (or 120052 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1122113010213 its reverse (3120103112211), we get a palindrome (4242216122424).
The spelling of 1122113010213 in words is "one trillion, one hundred twenty-two billion, one hundred thirteen million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •