Base | Representation |
---|---|
bin | 110100100010111111110000… |
… | …100011011111100101101111 |
3 | 1010022021021010012022200110012 |
4 | 310202333300203133211233 |
5 | 220242344120312212033 |
6 | 2135303224222203435 |
7 | 66451444142625434 |
oct | 6442776043374557 |
9 | 1108237105280405 |
10 | 231103341132143 |
11 | 67700416243427 |
12 | 21b0546142357b |
13 | 9bc4c4a75a65c |
14 | 410d6660bdb8b |
15 | 1bab7dcce4248 |
hex | d22ff08df96f |
231103341132143 has 16 divisors (see below), whose sum is σ = 248861472261600. Its totient is φ = 213959720540160.
The previous prime is 231103341132137. The next prime is 231103341132151. The reversal of 231103341132143 is 341231143301132.
It is a cyclic number.
It is not a de Polignac number, because 231103341132143 - 216 = 231103341066607 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 (231103341132173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 764165378 + ... + 764467743.
It is an arithmetic number, because the mean of its divisors is an integer number (15553842016350).
Almost surely, 2231103341132143 is an apocalyptic number.
231103341132143 is a deficient number, since it is larger than the sum of its proper divisors (17758131129457).
231103341132143 is a wasteful number, since it uses less digits than its factorization.
231103341132143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1528633322.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 231103341132143 its reverse (341231143301132), we get a palindrome (572334484433275).
The spelling of 231103341132143 in words is "two hundred thirty-one trillion, one hundred three billion, three hundred forty-one million, one hundred thirty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •