Base | Representation |
---|---|
bin | 10011001110011110111… |
… | …110010101010101101011 |
3 | 11200022022020110211222010 |
4 | 103032132332111111223 |
5 | 133121330324202311 |
6 | 2450543330531003 |
7 | 164312054361120 |
oct | 23163676252553 |
9 | 4608266424863 |
10 | 1321222100331 |
11 | 46a366482291 |
12 | 19408a736a63 |
13 | 9778aa33963 |
14 | 47d39cb4747 |
15 | 2457c0e4da6 |
hex | 1339ef9556b |
1321222100331 has 16 divisors (see below), whose sum is σ = 2015262733568. Its totient is φ = 754244589600.
The previous prime is 1321222100329. The next prime is 1321222100383. The reversal of 1321222100331 is 1330012221231.
It is not a de Polignac number, because 1321222100331 - 21 = 1321222100329 is a prime.
It is a super-2 number, since 2×13212221003312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1321222100298 and 1321222100307.
It is not an unprimeable number, because it can be changed into a prime (1321222100311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30789205 + ... + 30832086.
It is an arithmetic number, because the mean of its divisors is an integer number (125953920848).
Almost surely, 21321222100331 is an apocalyptic number.
1321222100331 is a deficient number, since it is larger than the sum of its proper divisors (694040633237).
1321222100331 is a wasteful number, since it uses less digits than its factorization.
1321222100331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61622322.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1321222100331 its reverse (1330012221231), we get a palindrome (2651234321562).
The spelling of 1321222100331 in words is "one trillion, three hundred twenty-one billion, two hundred twenty-two million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •