Base | Representation |
---|---|
bin | 11000000000111… |
… | …10001111000001 |
3 | 112001001202001011 |
4 | 30000132033001 |
5 | 403032403213 |
6 | 31553440521 |
7 | 4664205022 |
oct | 1400361701 |
9 | 461052034 |
10 | 201450433 |
11 | a3793768 |
12 | 57570141 |
13 | 32974552 |
14 | 1ca7cc49 |
15 | 12a4403d |
hex | c01e3c1 |
201450433 has 4 divisors (see below), whose sum is σ = 201538260. Its totient is φ = 201362608.
The previous prime is 201450419. The next prime is 201450439. The reversal of 201450433 is 334054102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 334054102 = 2 ⋅167027051.
It can be written as a sum of positive squares in 2 ways, for example, as 119421184 + 82029249 = 10928^2 + 9057^2 .
It is a cyclic number.
It is not a de Polignac number, because 201450433 - 25 = 201450401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201450439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40378 + ... + 45091.
It is an arithmetic number, because the mean of its divisors is an integer number (50384565).
Almost surely, 2201450433 is an apocalyptic number.
It is an amenable number.
201450433 is a deficient number, since it is larger than the sum of its proper divisors (87827).
201450433 is an equidigital number, since it uses as much as digits as its factorization.
201450433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87826.
The product of its (nonzero) digits is 1440, while the sum is 22.
The square root of 201450433 is about 14193.3235360855. The cubic root of 201450433 is about 586.2138411633.
The spelling of 201450433 in words is "two hundred one million, four hundred fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •