Base | Representation |
---|---|
bin | 10110100101000110… |
… | …00001011110000101 |
3 | 1011021211022012221201 |
4 | 23102203001132011 |
5 | 144311304043023 |
6 | 5322515342501 |
7 | 606255053632 |
oct | 132243013605 |
9 | 34254265851 |
10 | 12122331013 |
11 | 5160815791 |
12 | 24238b1a31 |
13 | 11b25c6740 |
14 | 82dd83189 |
15 | 4ae386bad |
hex | 2d28c1785 |
12122331013 has 8 divisors (see below), whose sum is σ = 13056602328. Its totient is φ = 11188314624.
The previous prime is 12122331007. The next prime is 12122331041. The reversal of 12122331013 is 31013322121.
It can be written as a sum of positive squares in 4 ways, for example, as 1500555169 + 10621775844 = 38737^2 + 103062^2 .
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 12122331013 - 233 = 3532396421 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 (12122331043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41481 + ... + 161137.
It is an arithmetic number, because the mean of its divisors is an integer number (1632075291).
Almost surely, 212122331013 is an apocalyptic number.
12122331013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12122331013 is a deficient number, since it is larger than the sum of its proper divisors (934271315).
12122331013 is a wasteful number, since it uses less digits than its factorization.
12122331013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127463.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12122331013 its reverse (31013322121), we get a palindrome (43135653134).
The spelling of 12122331013 in words is "twelve billion, one hundred twenty-two million, three hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •