Base | Representation |
---|---|
bin | 1001001001111101000101… |
… | …01111001101010000011011 |
3 | 2122021201102020210102202212 |
4 | 10210332202233031100123 |
5 | 10114330334423003121 |
6 | 110453030024345335 |
7 | 4145402335235321 |
oct | 444764257152033 |
9 | 78251366712685 |
10 | 20133242000411 |
11 | 6462507267051 |
12 | 2311b5a01524b |
13 | b30730a412b7 |
14 | 4d8650125d11 |
15 | 24daa264225b |
hex | 124fa2bcd41b |
20133242000411 has 2 divisors, whose sum is σ = 20133242000412. Its totient is φ = 20133242000410.
The previous prime is 20133242000393. The next prime is 20133242000467. The reversal of 20133242000411 is 11400024233102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20133242000411 - 238 = 19858364093467 is a prime.
It is a super-2 number, since 2×201332420004112 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (20133242000471) 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, 10066621000205 + 10066621000206.
It is an arithmetic number, because the mean of its divisors is an integer number (10066621000206).
Almost surely, 220133242000411 is an apocalyptic number.
20133242000411 is a deficient number, since it is larger than the sum of its proper divisors (1).
20133242000411 is an equidigital number, since it uses as much as digits as its factorization.
20133242000411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 20133242000411 its reverse (11400024233102), we get a palindrome (31533266233513).
The spelling of 20133242000411 in words is "twenty trillion, one hundred thirty-three billion, two hundred forty-two million, four hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •