Base | Representation |
---|---|
bin | 100101110110101… |
… | …011010111100001 |
3 | 1122021000221020201 |
4 | 211312223113201 |
5 | 2300040343101 |
6 | 143004105201 |
7 | 21511115341 |
oct | 4566532741 |
9 | 1567027221 |
10 | 635090401 |
11 | 2a6545900 |
12 | 158835201 |
13 | a176384a |
14 | 604bcd21 |
15 | 3ab4ee01 |
hex | 25dab5e1 |
635090401 has 27 divisors (see below), whose sum is σ = 732243603. Its totient is φ = 550389840.
The previous prime is 635090399. The next prime is 635090411. The reversal of 635090401 is 104090536.
The square root of 635090401 is 25201.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 333026001 + 302064400 = 18249^2 + 17380^2 .
It is not a de Polignac number, because 635090401 - 21 = 635090399 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 635090401.
It is not an unprimeable number, because it can be changed into a prime (635090411) 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 26 ways as a sum of consecutive naturals, for example, 8039080 + ... + 8039158.
Almost surely, 2635090401 is an apocalyptic number.
635090401 is the 25201-st square number.
635090401 is the 12601-st centered octagonal number.
It is an amenable number.
635090401 is a deficient number, since it is larger than the sum of its proper divisors (97153202).
635090401 is an equidigital number, since it uses as much as digits as its factorization.
635090401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238 (or 119 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 28.
The cubic root of 635090401 is about 859.5645898508.
The spelling of 635090401 in words is "six hundred thirty-five million, ninety thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •