Base | Representation |
---|---|
bin | 111001010010111000… |
… | …0011100011000101111 |
3 | 102202120212111211121001 |
4 | 1302211300130120233 |
5 | 4003441221232421 |
6 | 132305050421131 |
7 | 11614021643314 |
oct | 1624560343057 |
9 | 382525454531 |
10 | 123040024111 |
11 | 481a9982244 |
12 | 1ba19a317a7 |
13 | b7aac733c4 |
14 | 5d52daad0b |
15 | 3301d03691 |
hex | 1ca5c1c62f |
123040024111 has 4 divisors (see below), whose sum is σ = 123253265632. Its totient is φ = 122826782592.
The previous prime is 123040024103. The next prime is 123040024127. The reversal of 123040024111 is 111420040321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 123040024111 - 23 = 123040024103 is a prime.
It is a super-2 number, since 2×1230400241112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123040024181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106619895 + ... + 106621048.
It is an arithmetic number, because the mean of its divisors is an integer number (30813316408).
Almost surely, 2123040024111 is an apocalyptic number.
123040024111 is a deficient number, since it is larger than the sum of its proper divisors (213241521).
123040024111 is an equidigital number, since it uses as much as digits as its factorization.
123040024111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213241520.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 123040024111 its reverse (111420040321), we get a palindrome (234460064432).
The spelling of 123040024111 in words is "one hundred twenty-three billion, forty million, twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •