Base | Representation |
---|---|
bin | 100111101100110… |
… | …0100000001011101 |
3 | 10102211120202022222 |
4 | 1033121210001131 |
5 | 10212004214323 |
6 | 340103315125 |
7 | 45003450002 |
oct | 11731440135 |
9 | 3384522288 |
10 | 1332101213 |
11 | 623a333a3 |
12 | 31214baa5 |
13 | 182c97491 |
14 | c8cb98a9 |
15 | 7be319c8 |
hex | 4f66405d |
1332101213 has 4 divisors (see below), whose sum is σ = 1360443840. Its totient is φ = 1303758588.
The previous prime is 1332101203. The next prime is 1332101237. The reversal of 1332101213 is 3121012331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1332101213 - 220 = 1331052637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332101191 and 1332101200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332101203) 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, 14171243 + ... + 14171336.
It is an arithmetic number, because the mean of its divisors is an integer number (340110960).
Almost surely, 21332101213 is an apocalyptic number.
It is an amenable number.
1332101213 is a deficient number, since it is larger than the sum of its proper divisors (28342627).
1332101213 is an equidigital number, since it uses as much as digits as its factorization.
1332101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28342626.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1332101213 is about 36497.9617650082. The cubic root of 1332101213 is about 1100.3032808376.
Adding to 1332101213 its reverse (3121012331), we get a palindrome (4453113544).
The spelling of 1332101213 in words is "one billion, three hundred thirty-two million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •