Base | Representation |
---|---|
bin | 1011000010010111110010… |
… | …0000001101100101000101 |
3 | 1120222010111220022021110000 |
4 | 2300211330200031211011 |
5 | 3042311220041231323 |
6 | 41450525045351513 |
7 | 2361515550125163 |
oct | 260457440154505 |
9 | 46863456267400 |
10 | 12135371430213 |
11 | 3959644892a59 |
12 | 143babb408599 |
13 | 6a048c370595 |
14 | 2dd4d85d4233 |
15 | 160a07608e43 |
hex | b097c80d945 |
12135371430213 has 20 divisors (see below), whose sum is σ = 18712926398848. Its totient is φ = 7829271888840.
The previous prime is 12135371430103. The next prime is 12135371430227. The reversal of 12135371430213 is 31203417353121.
12135371430213 is a `hidden beast` number, since 1 + 2 + 1 + 3 + 5 + 3 + 7 + 1 + 430 + 213 = 666.
It is not a de Polignac number, because 12135371430213 - 28 = 12135371429957 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 (12135371430293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2416439431 + ... + 2416444452.
Almost surely, 212135371430213 is an apocalyptic number.
It is an amenable number.
12135371430213 is a deficient number, since it is larger than the sum of its proper divisors (6577554968635).
12135371430213 is an equidigital number, since it uses as much as digits as its factorization.
12135371430213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4832883926 (or 4832883917 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 36.
Adding to 12135371430213 its reverse (31203417353121), we get a palindrome (43338788783334).
The spelling of 12135371430213 in words is "twelve trillion, one hundred thirty-five billion, three hundred seventy-one million, four hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •