Base | Representation |
---|---|
bin | 10001110011010011101… |
… | …000000011001011011111 |
3 | 11022221121100122222211101 |
4 | 101303103220003023133 |
5 | 130020330212002143 |
6 | 2333552550533531 |
7 | 154245016442524 |
oct | 21632350031337 |
9 | 4287540588741 |
10 | 1223321203423 |
11 | 431897a22430 |
12 | 1791079672a7 |
13 | 8b488089a67 |
14 | 432cd94914b |
15 | 21c4c2e6b4d |
hex | 11cd3a032df |
1223321203423 has 8 divisors (see below), whose sum is σ = 1347745413456. Its totient is φ = 1101099192000.
The previous prime is 1223321203411. The next prime is 1223321203427. The reversal of 1223321203423 is 3243021233221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1223321203423 - 225 = 1223287648991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1223321203391 and 1223321203400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223321203427) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 550548486 + ... + 550550707.
It is an arithmetic number, because the mean of its divisors is an integer number (168468176682).
Almost surely, 21223321203423 is an apocalyptic number.
1223321203423 is a deficient number, since it is larger than the sum of its proper divisors (124424210033).
1223321203423 is a wasteful number, since it uses less digits than its factorization.
1223321203423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101099305.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 1223321203423 its reverse (3243021233221), we get a palindrome (4466342436644).
The spelling of 1223321203423 in words is "one trillion, two hundred twenty-three billion, three hundred twenty-one million, two hundred three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •