Base | Representation |
---|---|
bin | 1000011110110001… |
… | …11000111111000001 |
3 | 102202022120000011001 |
4 | 10033120320333001 |
5 | 33311101303101 |
6 | 2031445452001 |
7 | 220555065652 |
oct | 41730707701 |
9 | 12668500131 |
10 | 4553150401 |
11 | 1a27153318 |
12 | a70a11001 |
13 | 5773c5b47 |
14 | 3129c3529 |
15 | 1b9adb901 |
hex | 10f638fc1 |
4553150401 has 2 divisors, whose sum is σ = 4553150402. Its totient is φ = 4553150400.
The previous prime is 4553150359. The next prime is 4553150461. The reversal of 4553150401 is 1040513554.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4169930625 + 383219776 = 64575^2 + 19576^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4553150401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4553150401.
It is not a weakly prime, because it can be changed into another prime (4553150461) 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 as a sum of consecutive naturals, namely, 2276575200 + 2276575201.
It is an arithmetic number, because the mean of its divisors is an integer number (2276575201).
Almost surely, 24553150401 is an apocalyptic number.
It is an amenable number.
4553150401 is a deficient number, since it is larger than the sum of its proper divisors (1).
4553150401 is an equidigital number, since it uses as much as digits as its factorization.
4553150401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 4553150401 is about 67477.0361011804. The cubic root of 4553150401 is about 1657.4381542806.
Adding to 4553150401 its reverse (1040513554), we get a palindrome (5593663955).
The spelling of 4553150401 in words is "four billion, five hundred fifty-three million, one hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •