Base | Representation |
---|---|
bin | 10011010111111001000… |
… | …011000011010011100111 |
3 | 11201021101012111221212201 |
4 | 103113321003003103213 |
5 | 133303022221034343 |
6 | 2455333524555331 |
7 | 165120300444142 |
oct | 23277103032347 |
9 | 4637335457781 |
10 | 1331323221223 |
11 | 47367a283986 |
12 | 196029552b47 |
13 | 9870a667b78 |
14 | 4861763b059 |
15 | 2496dcc994d |
hex | 135f90c34e7 |
1331323221223 has 8 divisors (see below), whose sum is σ = 1335094956720. Its totient is φ = 1327556766720.
The previous prime is 1331323221187. The next prime is 1331323221247. The reversal of 1331323221223 is 3221223231331.
It is a happy number.
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-1331323221223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1331323221191 and 1331323221200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331323521223) 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, 815068 + ... + 1824001.
It is an arithmetic number, because the mean of its divisors is an integer number (166886869590).
Almost surely, 21331323221223 is an apocalyptic number.
1331323221223 is a deficient number, since it is larger than the sum of its proper divisors (3771735497).
1331323221223 is an equidigital number, since it uses as much as digits as its factorization.
1331323221223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2640497.
The product of its digits is 7776, while the sum is 28.
Adding to 1331323221223 its reverse (3221223231331), we get a palindrome (4552546452554).
The spelling of 1331323221223 in words is "one trillion, three hundred thirty-one billion, three hundred twenty-three million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •