Base | Representation |
---|---|
bin | 10110100110001000… |
… | …01001001000000010 |
3 | 1011022102122022120022 |
4 | 23103010021020002 |
5 | 144321014404442 |
6 | 5323425413442 |
7 | 606421624124 |
oct | 132304111002 |
9 | 34272568508 |
10 | 12131013122 |
11 | 5165705788 |
12 | 242679a282 |
13 | 11b4346497 |
14 | 8311a3214 |
15 | 4aeeee3d2 |
hex | 2d3109202 |
12131013122 has 8 divisors (see below), whose sum is σ = 18274617036. Its totient is φ = 6039474112.
The previous prime is 12131013121. The next prime is 12131013131. The reversal of 12131013122 is 22131013121.
It can be written as a sum of positive squares in 2 ways, for example, as 11722609441 + 408403681 = 108271^2 + 20209^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×121310131222 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12131013122.
It is not an unprimeable number, because it can be changed into a prime (12131013121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13015643 + ... + 13016574.
Almost surely, 212131013122 is an apocalyptic number.
12131013122 is a deficient number, since it is larger than the sum of its proper divisors (6143603914).
12131013122 is a wasteful number, since it uses less digits than its factorization.
12131013122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26032452.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12131013122 its reverse (22131013121), we get a palindrome (34262026243).
Subtracting 12131013122 from its reverse (22131013121), we obtain a palindrome (9999999999).
The spelling of 12131013122 in words is "twelve billion, one hundred thirty-one million, thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •