Base | Representation |
---|---|
bin | 10011001110100000001… |
… | …110111010010101111111 |
3 | 11200022100201020000101212 |
4 | 103032200032322111333 |
5 | 133121401231122143 |
6 | 2450545403355035 |
7 | 164312432045354 |
oct | 23164016722577 |
9 | 4608321200355 |
10 | 1321243223423 |
11 | 46a37739a392 |
12 | 194095822a7b |
13 | 9779221b326 |
14 | 47d3ca1262b |
15 | 2457ddb8918 |
hex | 133a03ba57f |
1321243223423 has 32 divisors (see below), whose sum is σ = 1353701690880. Its totient is φ = 1289332961280.
The previous prime is 1321243223407. The next prime is 1321243223441. The reversal of 1321243223423 is 3243223421231.
It is a cyclic number.
It is not a de Polignac number, because 1321243223423 - 24 = 1321243223407 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1321243223423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321243223473) 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 31 ways as a sum of consecutive naturals, for example, 2415435236 + ... + 2415435782.
It is an arithmetic number, because the mean of its divisors is an integer number (42303177840).
Almost surely, 21321243223423 is an apocalyptic number.
1321243223423 is a deficient number, since it is larger than the sum of its proper divisors (32458467457).
1321243223423 is a wasteful number, since it uses less digits than its factorization.
1321243223423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1647.
The product of its digits is 41472, while the sum is 32.
Adding to 1321243223423 its reverse (3243223421231), we get a palindrome (4564466644654).
The spelling of 1321243223423 in words is "one trillion, three hundred twenty-one billion, two hundred forty-three million, two hundred twenty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •