Base | Representation |
---|---|
bin | 100011110011000… |
… | …1110000010110011 |
3 | 10002201021100110012 |
4 | 1013212032002303 |
5 | 4430001420311 |
6 | 315105525135 |
7 | 41524020461 |
oct | 10746160263 |
9 | 3081240405 |
10 | 1201201331 |
11 | 567057380 |
12 | 2963437ab |
13 | 161b25225 |
14 | b5763831 |
15 | 706c678b |
hex | 4798e0b3 |
1201201331 has 4 divisors (see below), whose sum is σ = 1310401464. Its totient is φ = 1092001200.
The previous prime is 1201201301. The next prime is 1201201357. The reversal of 1201201331 is 1331021021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1201201331 is a prime.
It is a super-2 number, since 2×12012013312 = 2885769275192343122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1201201301) 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, 54600050 + ... + 54600071.
It is an arithmetic number, because the mean of its divisors is an integer number (327600366).
Almost surely, 21201201331 is an apocalyptic number.
1201201331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1201201331 is a deficient number, since it is larger than the sum of its proper divisors (109200133).
1201201331 is a wasteful number, since it uses less digits than its factorization.
1201201331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109200132.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1201201331 is about 34658.3515332163. The cubic root of 1201201331 is about 1063.0130633247.
Adding to 1201201331 its reverse (1331021021), we get a palindrome (2532222352).
The spelling of 1201201331 in words is "one billion, two hundred one million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •