Search a number
201043033131 = 3311215480207
BaseRepresentation
bin1011101100111100011…
…0010011110000101011
3201012221000221020222010
42323033012103300223
511243214004030011
6232205145531003
720345014404633
oct2731706236053
9635830836863
10201043033131
1178297607456
1232b68aa3a63
1315c5c445645
149a328316c3
155369d061a6
hex2ecf193c2b

201043033131 has 8 divisors (see below), whose sum is σ = 268919299584. Its totient is φ = 133597727720.

The previous prime is 201043033129. The next prime is 201043033151. The reversal of 201043033131 is 131330340102.

Adding to 201043033131 its reverse (131330340102), we get a palindrome (332373373233).

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 201043033131 - 21 = 201043033129 is a prime.

It is a super-2 number, since 2×2010430331312 (a number of 23 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 201043033098 and 201043033107.

It is not an unprimeable number, because it can be changed into a prime (201043033151) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 107739171 + ... + 107741036.

It is an arithmetic number, because the mean of its divisors is an integer number (33614912448).

Almost surely, 2201043033131 is an apocalyptic number.

201043033131 is a deficient number, since it is larger than the sum of its proper divisors (67876266453).

201043033131 is a wasteful number, since it uses less digits than its factorization.

201043033131 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 215480521.

The product of its (nonzero) digits is 648, while the sum is 21.

The spelling of 201043033131 in words is "two hundred one billion, forty-three million, thirty-three thousand, one hundred thirty-one".