Base | Representation |
---|---|
bin | 10000101000110011111… |
… | …010001110001101101001 |
3 | 11001022010210020200002222 |
4 | 100220303322032031221 |
5 | 122213021020420241 |
6 | 2233123425003425 |
7 | 145413560235002 |
oct | 20506372161551 |
9 | 4038123220088 |
10 | 1143332201321 |
11 | 400980248222 |
12 | 165703783575 |
13 | 83a7b305a9b |
14 | 3d4a24341a9 |
15 | 1eb19c9ba4b |
hex | 10a33e8e369 |
1143332201321 has 4 divisors (see below), whose sum is σ = 1143433634772. Its totient is φ = 1143230767872.
The previous prime is 1143332201293. The next prime is 1143332201351. The reversal of 1143332201321 is 1231022333411.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 479229445696 + 664102755625 = 692264^2 + 814925^2 .
It is a cyclic number.
It is not a de Polignac number, because 1143332201321 - 26 = 1143332201257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1143332201351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50699816 + ... + 50722361.
It is an arithmetic number, because the mean of its divisors is an integer number (285858408693).
Almost surely, 21143332201321 is an apocalyptic number.
It is an amenable number.
1143332201321 is a deficient number, since it is larger than the sum of its proper divisors (101433451).
1143332201321 is a wasteful number, since it uses less digits than its factorization.
1143332201321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101433450.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 1143332201321 its reverse (1231022333411), we get a palindrome (2374354534732).
The spelling of 1143332201321 in words is "one trillion, one hundred forty-three billion, three hundred thirty-two million, two hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •