Base | Representation |
---|---|
bin | 10011010111101101000… |
… | …000000111001101110100 |
3 | 11201020212010020100220020 |
4 | 103113231000013031310 |
5 | 133302114001433322 |
6 | 2455301505205140 |
7 | 165112264604055 |
oct | 23275500071564 |
9 | 4636763210806 |
10 | 1331121124212 |
11 | 473586199460 |
12 | 195b919307b0 |
13 | 986a7828239 |
14 | 485d887072c |
15 | 2495b1a905c |
hex | 135ed007374 |
1331121124212 has 48 divisors (see below), whose sum is σ = 3397540887552. Its totient is φ = 402270922080.
The previous prime is 1331121124181. The next prime is 1331121124213. The reversal of 1331121124212 is 2124211211331.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331121124213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13690318 + ... + 13787205.
It is an arithmetic number, because the mean of its divisors is an integer number (70782101824).
Almost surely, 21331121124212 is an apocalyptic number.
1331121124212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1331121124212 is an abundant number, since it is smaller than the sum of its proper divisors (2066419763340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1331121124212 is a wasteful number, since it uses less digits than its factorization.
1331121124212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27477908 (or 27477906 counting only the distinct ones).
The product of its digits is 576, while the sum is 24.
Adding to 1331121124212 its reverse (2124211211331), we get a palindrome (3455332335543).
The spelling of 1331121124212 in words is "one trillion, three hundred thirty-one billion, one hundred twenty-one million, one hundred twenty-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •