Base | Representation |
---|---|
bin | 10011010111111001100… |
… | …101101011110101000111 |
3 | 11201021101211121012202112 |
4 | 103113321211223311013 |
5 | 133303032032100403 |
6 | 2455334451331235 |
7 | 165120440556161 |
oct | 23277145536507 |
9 | 4637354535675 |
10 | 1331332300103 |
11 | 473684414a93 |
12 | 1960305b0b1b |
13 | 9870c4c63a0 |
14 | 48618921931 |
15 | 2496e9be9d8 |
hex | 135f996bd47 |
1331332300103 has 4 divisors (see below), whose sum is σ = 1433742477048. Its totient is φ = 1228922123160.
The previous prime is 1331332300093. The next prime is 1331332300153. The reversal of 1331332300103 is 3010032331331.
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 1331332300103 - 214 = 1331332283719 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 (1331332300153) 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, 51205088453 + ... + 51205088478.
It is an arithmetic number, because the mean of its divisors is an integer number (358435619262).
Almost surely, 21331332300103 is an apocalyptic number.
1331332300103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1331332300103 is a deficient number, since it is larger than the sum of its proper divisors (102410176945).
1331332300103 is a wasteful number, since it uses less digits than its factorization.
1331332300103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102410176944.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 1331332300103 its reverse (3010032331331), we get a palindrome (4341364631434).
The spelling of 1331332300103 in words is "one trillion, three hundred thirty-one billion, three hundred thirty-two million, three hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •