Base | Representation |
---|---|
bin | 10011001110011110110… |
… | …110011100101100010101 |
3 | 11200022022002120211112110 |
4 | 103032132312130230111 |
5 | 133121324312031201 |
6 | 2450543214341233 |
7 | 164312030661600 |
oct | 23163666345425 |
9 | 4608262524473 |
10 | 1321220033301 |
11 | 46a3652a02a3 |
12 | 194089aba819 |
13 | 9778a48bb6c |
14 | 47d398d7337 |
15 | 2457bd376d6 |
hex | 1339ed9cb15 |
1321220033301 has 48 divisors (see below), whose sum is σ = 2125793859840. Its totient is φ = 727244743680.
The previous prime is 1321220033299. The next prime is 1321220033311. The reversal of 1321220033301 is 1033300221231.
It is not a de Polignac number, because 1321220033301 - 21 = 1321220033299 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1321220033311) 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 47 ways as a sum of consecutive naturals, for example, 911316 + ... + 1863581.
It is an arithmetic number, because the mean of its divisors is an integer number (44287372080).
Almost surely, 21321220033301 is an apocalyptic number.
It is an amenable number.
1321220033301 is a deficient number, since it is larger than the sum of its proper divisors (804573826539).
1321220033301 is a wasteful number, since it uses less digits than its factorization.
1321220033301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2775034 (or 2775027 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1321220033301 its reverse (1033300221231), we get a palindrome (2354520254532).
The spelling of 1321220033301 in words is "one trillion, three hundred twenty-one billion, two hundred twenty million, thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •