Base | Representation |
---|---|
bin | 10011011000100111011… |
… | …011010001000110001111 |
3 | 11201100101102122112020210 |
4 | 103120213123101012033 |
5 | 133311120414233403 |
6 | 2455543042213503 |
7 | 165145466256000 |
oct | 23304733210617 |
9 | 4640342575223 |
10 | 1332101321103 |
11 | 473a39516933 |
12 | 196206054293 |
13 | 988029207b7 |
14 | 4868cb051a7 |
15 | 249b7277b03 |
hex | 136276d118f |
1332101321103 has 32 divisors (see below), whose sum is σ = 2073497241600. Its totient is φ = 760391274720.
The previous prime is 1332101321071. The next prime is 1332101321141. The reversal of 1332101321103 is 3011231012331.
It is a happy number.
It is not a de Polignac number, because 1332101321103 - 25 = 1332101321071 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 1332101321103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332101321203) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 280426 + ... + 1656152.
It is an arithmetic number, because the mean of its divisors is an integer number (64796788800).
Almost surely, 21332101321103 is an apocalyptic number.
1332101321103 is a deficient number, since it is larger than the sum of its proper divisors (741395920497).
1332101321103 is an equidigital number, since it uses as much as digits as its factorization.
1332101321103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376692 (or 1376678 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1332101321103 its reverse (3011231012331), we get a palindrome (4343332333434).
The spelling of 1332101321103 in words is "one trillion, three hundred thirty-two billion, one hundred one million, three hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •