Base | Representation |
---|---|
bin | 111101010000011… |
… | …0100110101111001 |
3 | 12022020122102120201 |
4 | 1322200310311321 |
5 | 13202142103101 |
6 | 535542522201 |
7 | 101635553611 |
oct | 17240646571 |
9 | 5266572521 |
10 | 2055425401 |
11 | 965263587 |
12 | 494436361 |
13 | 269ab2063 |
14 | 156da5a41 |
15 | c06aee01 |
hex | 7a834d79 |
2055425401 has 4 divisors (see below), whose sum is σ = 2055769600. Its totient is φ = 2055081204.
The previous prime is 2055425389. The next prime is 2055425459. The reversal of 2055425401 is 1045245502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2055425401 - 211 = 2055423353 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 2055425401.
It is not an unprimeable number, because it can be changed into a prime (2055425201) 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 3 ways as a sum of consecutive naturals, for example, 162981 + ... + 175138.
It is an arithmetic number, because the mean of its divisors is an integer number (513942400).
Almost surely, 22055425401 is an apocalyptic number.
It is an amenable number.
2055425401 is a deficient number, since it is larger than the sum of its proper divisors (344199).
2055425401 is an equidigital number, since it uses as much as digits as its factorization.
2055425401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344198.
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 2055425401 is about 45336.7996334104. The cubic root of 2055425401 is about 1271.4537676895.
The spelling of 2055425401 in words is "two billion, fifty-five million, four hundred twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •