Base | Representation |
---|---|
bin | 11011111110000101000000… |
… | …011111001110011100110011 |
3 | 121010112221200012220210221002 |
4 | 123332011000133032130303 |
5 | 112110422104001032321 |
6 | 1113343300304552215 |
7 | 34624261524551531 |
oct | 3376050037163463 |
9 | 533487605823832 |
10 | 123013240252211 |
11 | 362176931a0391 |
12 | 1196895932266b |
13 | 538413903a12a |
14 | 2253c30591151 |
15 | e34ccb45720b |
hex | 6fe1407ce733 |
123013240252211 has 4 divisors (see below), whose sum is σ = 123013399928832. Its totient is φ = 123013080575592.
The previous prime is 123013240252193. The next prime is 123013240252237. The reversal of 123013240252211 is 112252042310321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123013240252211 is a prime.
It is a super-2 number, since 2×1230132402522112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123013240251211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78677096 + ... + 80225381.
It is an arithmetic number, because the mean of its divisors is an integer number (30753349982208).
Almost surely, 2123013240252211 is an apocalyptic number.
123013240252211 is a deficient number, since it is larger than the sum of its proper divisors (159676621).
123013240252211 is an equidigital number, since it uses as much as digits as its factorization.
123013240252211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159676620.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 123013240252211 its reverse (112252042310321), we get a palindrome (235265282562532).
The spelling of 123013240252211 in words is "one hundred twenty-three trillion, thirteen billion, two hundred forty million, two hundred fifty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •