Base | Representation |
---|---|
bin | 10011001110011110110… |
… | …110101101000001111111 |
3 | 11200022022002201020100001 |
4 | 103032132312231001333 |
5 | 133121324321201343 |
6 | 2450543220015131 |
7 | 164312031360652 |
oct | 23163666550177 |
9 | 4608262636301 |
10 | 1321220100223 |
11 | 46a365336601 |
12 | 194089b314a7 |
13 | 9778a4b346a |
14 | 47d39913899 |
15 | 2457bd4c44d |
hex | 1339edad07f |
1321220100223 has 8 divisors (see below), whose sum is σ = 1367556300800. Its totient is φ = 1275116162040.
The previous prime is 1321220100217. The next prime is 1321220100227. The reversal of 1321220100223 is 3220010221231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1321220100223 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 1321220100223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321220100227) 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, 58054023 + ... + 58076776.
It is an arithmetic number, because the mean of its divisors is an integer number (170944537600).
Almost surely, 21321220100223 is an apocalyptic number.
1321220100223 is a deficient number, since it is larger than the sum of its proper divisors (46336200577).
1321220100223 is a wasteful number, since it uses less digits than its factorization.
1321220100223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116131197.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1321220100223 its reverse (3220010221231), we get a palindrome (4541230321454).
The spelling of 1321220100223 in words is "one trillion, three hundred twenty-one billion, two hundred twenty million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •