Base | Representation |
---|---|
bin | 1011000110010100001111… |
… | …1001110110001001111001 |
3 | 1121012121102220022122200021 |
4 | 2301211003321312021321 |
5 | 3044414013134403213 |
6 | 41542013513410441 |
7 | 2366435134542502 |
oct | 261450371661171 |
9 | 47177386278607 |
10 | 12203141325433 |
11 | 3985361163323 |
12 | 1451073409a21 |
13 | 6a699c7759b6 |
14 | 3028c6d73ba9 |
15 | 162672052d8d |
hex | b1943e76279 |
12203141325433 has 2 divisors, whose sum is σ = 12203141325434. Its totient is φ = 12203141325432.
The previous prime is 12203141325409. The next prime is 12203141325449. The reversal of 12203141325433 is 33452314130221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9456289211664 + 2746852113769 = 3075108^2 + 1657363^2 .
It is a cyclic number.
It is not a de Polignac number, because 12203141325433 - 29 = 12203141324921 is a prime.
It is not a weakly prime, because it can be changed into another prime (12203141325493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101570662716 + 6101570662717.
It is an arithmetic number, because the mean of its divisors is an integer number (6101570662717).
Almost surely, 212203141325433 is an apocalyptic number.
It is an amenable number.
12203141325433 is a deficient number, since it is larger than the sum of its proper divisors (1).
12203141325433 is an equidigital number, since it uses as much as digits as its factorization.
12203141325433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 34.
Adding to 12203141325433 its reverse (33452314130221), we get a palindrome (45655455455654).
The spelling of 12203141325433 in words is "twelve trillion, two hundred three billion, one hundred forty-one million, three hundred twenty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •