Base | Representation |
---|---|
bin | 10111111111111… |
… | …00110010011001 |
3 | 112000210210010002 |
4 | 23333330302121 |
5 | 403014012213 |
6 | 31550502345 |
7 | 4663064426 |
oct | 1377746231 |
9 | 460723102 |
10 | 201313433 |
11 | a36aa842 |
12 | 575049b5 |
13 | 32927099 |
14 | 1ca44d4d |
15 | 12a18658 |
hex | bffcc99 |
201313433 has 4 divisors (see below), whose sum is σ = 201566820. Its totient is φ = 201060048.
The previous prime is 201313423. The next prime is 201313459. The reversal of 201313433 is 334313102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44262409 + 157051024 = 6653^2 + 12532^2 .
It is a cyclic number.
It is not a de Polignac number, because 201313433 - 210 = 201312409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201313423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 125498 + ... + 127091.
It is an arithmetic number, because the mean of its divisors is an integer number (50391705).
Almost surely, 2201313433 is an apocalyptic number.
It is an amenable number.
201313433 is a deficient number, since it is larger than the sum of its proper divisors (253387).
201313433 is an equidigital number, since it uses as much as digits as its factorization.
201313433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253386.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 201313433 is about 14188.4965024487. The cubic root of 201313433 is about 586.0809225959.
Adding to 201313433 its reverse (334313102), we get a palindrome (535626535).
The spelling of 201313433 in words is "two hundred one million, three hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •