Base | Representation |
---|---|
bin | 1011000111111001000011… |
… | …0110001101110100110111 |
3 | 1121022012021210210112102120 |
4 | 2301332100312031310313 |
5 | 3100334423204220343 |
6 | 42002251030211023 |
7 | 2401413543640242 |
oct | 261762066156467 |
9 | 47265253715376 |
10 | 12230202023223 |
11 | 3995888224078 |
12 | 1456365ab3a73 |
13 | 6a93c2bb9002 |
14 | 303d32c96259 |
15 | 163207ac7683 |
hex | b1f90d8dd37 |
12230202023223 has 4 divisors (see below), whose sum is σ = 16306936030968. Its totient is φ = 8153468015480.
The previous prime is 12230202023209. The next prime is 12230202023227. The reversal of 12230202023223 is 32232020203221.
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 12230202023223 - 214 = 12230202006839 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12230202023193 and 12230202023202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12230202023227) 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, 2038367003868 + ... + 2038367003873.
It is an arithmetic number, because the mean of its divisors is an integer number (4076734007742).
Almost surely, 212230202023223 is an apocalyptic number.
12230202023223 is a deficient number, since it is larger than the sum of its proper divisors (4076734007745).
12230202023223 is an equidigital number, since it uses as much as digits as its factorization.
12230202023223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4076734007744.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 12230202023223 its reverse (32232020203221), we get a palindrome (44462222226444).
The spelling of 12230202023223 in words is "twelve trillion, two hundred thirty billion, two hundred two million, twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •