Base | Representation |
---|---|
bin | 11100000001011011000101… |
… | …001101010110000011111011 |
3 | 121011100220222112222001221112 |
4 | 130001123011031112003323 |
5 | 112123203332122414321 |
6 | 1114041033145230535 |
7 | 34650006625102454 |
oct | 3401330515260373 |
9 | 534326875861845 |
10 | 123243100201211 |
11 | 362a6118139191 |
12 | 119a5408a9244b |
13 | 539ca0b6c6a83 |
14 | 2260dd826212b |
15 | e3ac8108da5b |
hex | 7016c53560fb |
123243100201211 has 12 divisors (see below), whose sum is σ = 130920586841352. Its totient is φ = 115992225105408.
The previous prime is 123243100201189. The next prime is 123243100201213. The reversal of 123243100201211 is 112102001342321.
It is a de Polignac number, because none of the positive numbers 2k-123243100201211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123243100201213) 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 in 11 ways as a sum of consecutive naturals, for example, 24384371 + ... + 29001443.
It is an arithmetic number, because the mean of its divisors is an integer number (10910048903446).
Almost surely, 2123243100201211 is an apocalyptic number.
123243100201211 is a deficient number, since it is larger than the sum of its proper divisors (7677486640141).
123243100201211 is an equidigital number, since it uses as much as digits as its factorization.
123243100201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4709470 (or 4709453 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 123243100201211 its reverse (112102001342321), we get a palindrome (235345101543532).
The spelling of 123243100201211 in words is "one hundred twenty-three trillion, two hundred forty-three billion, one hundred million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •