Base | Representation |
---|---|
bin | 100011110011010… |
… | …1011100000101111 |
3 | 10002201111111000120 |
4 | 1013212223200233 |
5 | 4430014301111 |
6 | 315112300023 |
7 | 41525032410 |
oct | 10746534057 |
9 | 3081444016 |
10 | 1201322031 |
11 | 56712a028 |
12 | 2963a1613 |
13 | 161b68150 |
14 | b5795807 |
15 | 706ec406 |
hex | 479ab82f |
1201322031 has 32 divisors (see below), whose sum is σ = 2024698368. Its totient is φ = 616533120.
The previous prime is 1201321999. The next prime is 1201322047. The reversal of 1201322031 is 1302231021.
It is not a de Polignac number, because 1201322031 - 25 = 1201321999 is a prime.
It is a super-2 number, since 2×12013220312 = 2886349244331929922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1201322031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201324031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 49365 + ... + 69566.
It is an arithmetic number, because the mean of its divisors is an integer number (63271824).
Almost surely, 21201322031 is an apocalyptic number.
1201322031 is a deficient number, since it is larger than the sum of its proper divisors (823376337).
1201322031 is a wasteful number, since it uses less digits than its factorization.
1201322031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118991.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1201322031 is about 34660.0927725244. The cubic root of 1201322031 is about 1063.0486669536.
Adding to 1201322031 its reverse (1302231021), we get a palindrome (2503553052).
The spelling of 1201322031 in words is "one billion, two hundred one million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •