Base | Representation |
---|---|
bin | 10011010111000011011… |
… | …010101010011011001111 |
3 | 11201012001111102101121002 |
4 | 103113003122222123033 |
5 | 133244201400103403 |
6 | 2455104343330515 |
7 | 165056063442401 |
oct | 23270332523317 |
9 | 4635044371532 |
10 | 1330423441103 |
11 | 473258391849 |
12 | 195a18150a3b |
13 | 985c611a5b3 |
14 | 4856dd3ab71 |
15 | 24919ce3188 |
hex | 135c36aa6cf |
1330423441103 has 4 divisors (see below), whose sum is σ = 1330426171680. Its totient is φ = 1330420710528.
The previous prime is 1330423441093. The next prime is 1330423441141. The reversal of 1330423441103 is 3011443240331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1330423441103 - 28 = 1330423440847 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330423441003) 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 3 ways as a sum of consecutive naturals, for example, 413063 + ... + 1682696.
It is an arithmetic number, because the mean of its divisors is an integer number (332606542920).
Almost surely, 21330423441103 is an apocalyptic number.
1330423441103 is a deficient number, since it is larger than the sum of its proper divisors (2730577).
1330423441103 is an equidigital number, since it uses as much as digits as its factorization.
1330423441103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2730576.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 1330423441103 its reverse (3011443240331), we get a palindrome (4341866681434).
The spelling of 1330423441103 in words is "one trillion, three hundred thirty billion, four hundred twenty-three million, four hundred forty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •