Base | Representation |
---|---|
bin | 111001010011101010… |
… | …0101110001111101111 |
3 | 102202122200222101100002 |
4 | 1302213110232033233 |
5 | 4004014433433123 |
6 | 132311430054515 |
7 | 11614461250361 |
oct | 1624724561757 |
9 | 382580871302 |
10 | 123066311663 |
11 | 482127a7499 |
12 | 1ba267aa43b |
13 | b7b3548679 |
14 | 5d56690d31 |
15 | 3304297528 |
hex | 1ca752e3ef |
123066311663 has 4 divisors (see below), whose sum is σ = 123068313600. Its totient is φ = 123064309728.
The previous prime is 123066311603. The next prime is 123066311671. The reversal of 123066311663 is 366113660321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 366113660321 = 797 ⋅459364693.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123066311663 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 (123066311603) 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 3 ways as a sum of consecutive naturals, for example, 905738 + ... + 1032711.
It is an arithmetic number, because the mean of its divisors is an integer number (30767078400).
Almost surely, 2123066311663 is an apocalyptic number.
123066311663 is a deficient number, since it is larger than the sum of its proper divisors (2001937).
123066311663 is an equidigital number, since it uses as much as digits as its factorization.
123066311663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2001936.
The product of its (nonzero) digits is 69984, while the sum is 38.
Adding to 123066311663 its reverse (366113660321), we get a palindrome (489179971984).
The spelling of 123066311663 in words is "one hundred twenty-three billion, sixty-six million, three hundred eleven thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •