Base | Representation |
---|---|
bin | 111001011000100010… |
… | …1111111101101101011 |
3 | 102210002010101221201011 |
4 | 1302301011333231223 |
5 | 4004333414120321 |
6 | 132340003204351 |
7 | 11621521420534 |
oct | 1626105775553 |
9 | 383063357634 |
10 | 123230223211 |
11 | 48297280687 |
12 | 1ba716766b7 |
13 | b80b4a8654 |
14 | 5d7035b68b |
15 | 3313873ae1 |
hex | 1cb117fb6b |
123230223211 has 4 divisors (see below), whose sum is σ = 123688328400. Its totient is φ = 122772118024.
The previous prime is 123230223139. The next prime is 123230223223. The reversal of 123230223211 is 112322032321.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112322032321 = 73 ⋅1538657977.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123230223211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123230223811) 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, 229052191 + ... + 229052728.
It is an arithmetic number, because the mean of its divisors is an integer number (30922082100).
Almost surely, 2123230223211 is an apocalyptic number.
123230223211 is a deficient number, since it is larger than the sum of its proper divisors (458105189).
123230223211 is an equidigital number, since it uses as much as digits as its factorization.
123230223211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458105188.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 123230223211 its reverse (112322032321), we get a palindrome (235552255532).
The spelling of 123230223211 in words is "one hundred twenty-three billion, two hundred thirty million, two hundred twenty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •